default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCID36th SoCG 2020: Zürich, Switzerland
- Sergio Cabello
, Danny Z. Chen:
36th International Symposium on Computational Geometry, SoCG 2020, June 23-26, 2020, Zürich, Switzerland. LIPIcs 164, Schloss Dagstuhl - Leibniz-Zentrum für Informatik 2020, ISBN 978-3-95977-143-6 - Front Matter, Table of Contents, Preface, Conference Organization. 0:1-0:20
- Eyal Ackerman, Balázs Keszegh, Günter Rote:
An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons. 1:1-1:18 - Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue:
Dynamic Geometric Set Cover and Hitting Set. 2:1-2:15 - Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, Meirav Zehavi:
The Parameterized Complexity of Guarding Almost Convex Polygons. 3:1-3:16 - Henk Alkema, Mark de Berg, Sándor Kisfaludi-Bak:
Euclidean TSP in Narrow Strips. 4:1-4:16 - Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky:
The ε-t-Net Problem. 5:1-5:15 - Safwa Ameer, Matt Gibson-Lopez, Erik Krohn, Sean Soderman, Qing Wang:
Terrain Visibility Graphs: Persistence Is Not Enough. 6:1-6:13 - Boris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton:
On β-Plurality Points in Spatial Voting Games. 7:1-7:15 - Boris Aronov, Esther Ezra, Micha Sharir:
Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets. 8:1-8:14 - Alan Arroyo, Julien Bensmail, R. Bruce Richter:
Extending Drawings of Graphs to Arrangements of Pseudolines. 9:1-9:14 - Shreya Arya, Jean-Daniel Boissonnat, Kunal Dutta, Martin Lotz:
Dimensionality Reduction for k-Distance Applied to Persistent Homology. 10:1-10:15 - Andrew Aukerman, Mathieu Carrière, Chao Chen, Kevin Gardner, Raúl Rabadán, Rami Vanguri:
Persistent Homology Based Characterization of the Breast Cancer Immune Microenvironment: A Feasibility Study. 11:1-11:20 - Sergey Avvakumov, Gabriel Nivasch:
Homotopic Curve Shortening and the Affine Curve-Shortening Flow. 12:1-12:15 - Sang Won Bae, Sang Duk Yoon:
Empty Squares in Arbitrary Orientation Among Points. 13:1-13:17 - Martin Balko, Manfred Scheucher, Pavel Valtr:
Holes and Islands in Random Point Sets. 14:1-14:16 - Ulrich Bauer, Claudia Landi, Facundo Mémoli:
The Reeb Graph Edit Distance Is Universal. 15:1-15:16 - Michael A. Bekos, Giordano Da Lozzo, Svenja Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou:
Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages. 16:1-16:17 - Talha Bin Masood, Tathagata Ray, Vijay Natarajan:
Parallel Computation of Alpha Complexes for Biomolecules. 17:1-17:16 - Nello Blaser, Morten Brun:
Relative Persistent Homology. 18:1-18:10 - Jean-Daniel Boissonnat, Siddharth Pritam:
Edge Collapse and Persistence of Flag Complexes. 19:1-19:15 - Jean-Daniel Boissonnat, Mathijs Wintraecken:
The Topological Correctness of PL-Approximations of Isomanifolds. 20:1-20:18 - Glencora Borradaile, William Maxwell, Amir Nayyeri:
Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes. 21:1-21:15 - Magnus Bakke Botnan, Vadim Lebovici, Steve Oudot:
On Rectangle-Decomposable 2-Parameter Persistence Modules. 22:1-22:16 - Claire Brécheteau:
Robust Anisotropic Power-Functions-Based Filtrations for Clustering. 23:1-23:15 - Kevin Buchin, Valentin Polishchuk, Leonid Sedov, Roman Voronov:
Geometric Secluded Paths and Planar Satisfiability. 24:1-24:15 - Benjamin A. Burton:
The Next 350 Million Knots. 25:1-25:17 - Chen Cai, Woojin Kim, Facundo Mémoli, Yusu Wang:
Elder-Rule-Staircodes for Augmented Metric Spaces. 26:1-26:17 - Timothy M. Chan, Qizheng He:
Faster Approximation Algorithms for Geometric Set Cover. 27:1-27:14 - Timothy M. Chan, Qizheng He, Yakov Nekrich:
Further Results on Colored Range Searching. 28:1-28:15 - Siu-Wing Cheng, Man-Kwun Chiu, Kai Jin, Man Ting Wong:
A Generalization of Self-Improving Algorithms. 29:1-29:13 - Siu-Wing Cheng, Man-Kit Lau:
Dynamic Distribution-Sensitive Point Location. 30:1-30:13 - Aruni Choudhary, Wolfgang Mulzer:
No-Dimensional Tverberg Theorems and Algorithms. 31:1-31:17 - David Cohen-Steiner, André Lieutier, Julien Vuillamy:
Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations. 32:1-32:17 - Erik D. Demaine, Adam Hesterberg, Jason S. Ku:
Finding Closed Quasigeodesics on Convex Polyhedra. 33:1-33:13 - Michael Dennis, Ljubomir Perkovic, Duru Türkoglu:
The Stretch Factor of Hexagon-Delaunay Triangulations. 34:1-34:16 - Vincent Despré, Jean-Marc Schlenker, Monique Teillaud:
Flipping Geometric Triangulations on Hyperbolic Surfaces. 35:1-35:16 - Tamal K. Dey, Tianqi Li, Yusu Wang:
An Efficient Algorithm for 1-Dimensional (Persistent) Path Homology. 36:1-36:15 - Tamal K. Dey, Marian Mrozek, Ryan Slechta:
Persistence of the Conley Index in Combinatorial Dynamical Systems. 37:1-37:17 - Günther Eder, Martin Held, Peter Palfrader:
On Implementing Straight Skeletons: Challenges and Experiences. 38:1-38:17 - Eduard Eiben, Daniel Lokshtanov:
Removing Connected Obstacles in the Plane Is FPT. 39:1-39:14 - Jeff Erickson, Patrick Lin:
A Toroidal Maxwell-Cremona-Delaunay Correspondence. 40:1-40:17 - Parker Evans, Brittany Terese Fasy, Carola Wenk:
Combinatorial Properties of Self-Overlapping Curves and Interior Boundaries. 41:1-41:17 - Sándor P. Fekete, Utkarsh Gupta, Phillip Keldenich, Christian Scheffer, Sahil Shah:
Worst-Case Optimal Covering of Rectangles by Disks. 42:1-42:23 - Sándor P. Fekete, Linda Kleist, Dominik Krupke:
Minimum Scan Cover with Angular Transition Costs. 43:1-43:18 - Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, Meirav Zehavi:
ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs. 44:1-44:18 - Kyle Fox, Jiashuai Lu:
A Near-Linear Time Approximation Scheme for Geometric Transportation with Arbitrary Supplies and Spread. 45:1-45:18 - Jacob Fox, János Pach, Andrew Suk:
Bounded VC-Dimension Implies the Schur-Erdős Conjecture. 46:1-46:8 - Nóra Frankl, Tamás Hubai, Dömötör Pálvölgyi:
Almost-Monochromatic Sets and the Chromatic Number of the Plane. 47:1-47:15 - Nóra Frankl, Andrey Kupavskii:
Almost Sharp Bounds on the Number of Discrete Chains in the Plane. 48:1-48:15 - Xavier Goaoc, Emo Welzl:
Convex Hulls of Random Order Types. 49:1-49:15 - Sariel Har-Peled, Mitchell Jones:
Fast Algorithms for Geometric Consensuses. 50:1-50:16 - Monika Henzinger, Stefan Neumann, Andreas Wiese:
Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles. 51:1-51:14 - Haim Kaplan, Micha Sharir, Uri Stemmer:
How to Find a Point in the Convex Hull Privately. 52:1-52:15 - Michael Kerber, Arnur Nigmetov:
Efficient Approximation of the Matching Distance for 2-Parameter Persistence. 53:1-53:16 - Jisu Kim, Jaehyeok Shin, Frédéric Chazal, Alessandro Rinaldo, Larry A. Wasserman:
Homotopy Reconstruction via the Cech Complex and the Vietoris-Rips Complex. 54:1-54:19 - Sándor Kisfaludi-Bak:
A Quasi-Polynomial Algorithm for Well-Spaced Hyperbolic TSP. 55:1-55:15 - Clément Maria, Steve Oudot, Elchanan Solomon:
Intrinsic Topological Transforms via the Distance Kernel Embedding. 56:1-56:15 - Wolfgang Mulzer, Pavel Valtr:
Long Alternating Paths Exist. 57:1-57:16 - Abhinandan Nath, Erin Taylor:
k-Median Clustering Under Discrete Fréchet and Hausdorff Distances. 58:1-58:15 - Yakov Nekrich:
Four-Dimensional Dominance Range Reporting in Linear Space. 59:1-59:14 - Dömötör Pálvölgyi:
Radon Numbers Grow Linearly. 60:1-60:5 - Zuzana Patáková:
Bounding Radon Number via Betti Numbers. 61:1-61:13 - Zuzana Patáková, Martin Tancer, Uli Wagner:
Barycentric Cuts Through a Convex Body. 62:1-62:16 - Jeff M. Phillips, Pingfan Tang:
Sketched MinDist. 63:1-63:16 - Abhishek Rathod:
Fast Algorithms for Minimum Cycle Basis and Minimum Homology Basis. 64:1-64:11 - Orit E. Raz, József Solymosi:
Dense Graphs Have Rigid Parts. 65:1-65:13 - Micha Sharir, Oleg Zlydenko:
Incidences Between Points and Curves with Almost Two Degrees of Freedom. 66:1-66:14 - Uli Wagner, Emo Welzl:
Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips). 67:1-67:16 - Haitao Wang:
On the Planar Two-Center Problem and Circular Hulls. 68:1-68:14 - Haitao Wang:
Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments. 69:1-69:14 - Simon Zhang, Mengbai Xiao, Hao Wang:
GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes. 70:1-70:17 - Casper van Dommelen, Marc J. van Kreveld, Jérôme Urhausen:
The Spiroplot App (Media Exposition). 71:1-71:5 - Victor M. Baez, Aaron T. Becker, Sándor P. Fekete, Arne Schmidt:
Coordinated Particle Relocation with Global Signals and Local Friction (Media Exposition). 72:1-72:5 - Amira Abdel-Rahman, Aaron T. Becker, Daniel Biediger, Kenneth C. Cheung, Sándor P. Fekete, Neil A. Gershenfeld, Sabrina Hugo, Benjamin Jenett, Phillip Keldenich, Eike Niehs, Christian Rieck, Arne Schmidt, Christian Scheffer, Michael Yannuzzi:
Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata (Media Exposition). 73:1-73:6 - Aaron T. Becker, Sándor P. Fekete:
How to Make a CG Video (Media Exposition). 74:1-74:6 - Sándor P. Fekete, Phillip Keldenich, Christian Scheffer:
Covering Rectangles by Disks: The Video (Media Exposition). 75:1-75:4 - Günther Eder, Martin Held, Peter Palfrader:
Step-By-Step Straight Skeletons (Media Exposition). 76:1-76:4 - Sean Dewar, Georg Grasegger, Jan Legerský:
Computing Animations of Linkages with Rotational Symmetry (Media Exposition). 77:1-77:4 - Tillmann Miltzow, Irene Parada, Willem Sonke, Bettina Speckmann, Jules Wulms:
Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition). 78:1-78:5 - Kevin Buchin, Mart Hagedoorn, Irina Kostitsyna, Max van Mulken, Jolan Rensen, Leo van Schooten:
Dots & Polygons (Media Exposition). 79:1-79:4 - Toon van Benthem, Kevin Buchin, Irina Kostitsyna, Stijn Slot:
Designing Art Galleries (Media Exposition). 80:1-80:5 - Herman J. Haverkort:
Plane-Filling Trails (Media Exposition). 81:1-81:5 - Youjia Zhou, Kevin P. Knudson, Bei Wang:
Visual Demo of Discrete Stratified Morse Theory (Media Exposition). 82:1-82:4 - Da Wei Zheng, Jack Spalding-Jamieson, Brandon Zhang:
Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge). 83:1-83:7 - Laurent Moalic, Dominique Schmitt, Julien Lepagnot, Julien Kritter:
Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge). 84:1-84:9 - Günther Eder, Martin Held, Stefan de Lorenzo, Peter Palfrader:
Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions (CG Challenge). 85:1-85:11
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
last updated on 2025-05-15 21:28 CEST by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
