Table of Contents

• On β-Plurality Points in Spatial Voting GamesBoris Aronov, Mark de Berg, Joachim Gudmundsson, Michael Horton. [doi]
• Efficient Approximation of the Matching Distance for 2-Parameter PersistenceMichael Kerber, Arnur Nigmetov. [doi]
• Combinatorial Properties of Self-Overlapping Curves and Interior BoundariesParker Evans, Brittany Terese Fasy, Carola Wenk. [doi]
• The Next 350 Million KnotsBenjamin A. Burton. [doi]
• Worst-Case Optimal Covering of Rectangles by DisksSándor P. Fekete, Utkarsh Gupta, Phillip Keldenich, Christian Scheffer, Sahil Shah. [doi]
• Four-Dimensional Dominance Range Reporting in Linear SpaceYakov Nekrich. [doi]
• GPU-Accelerated Computation of Vietoris-Rips Persistence BarcodesSimon Zhang, Mengbai Xiao, Hao Wang. [doi]
• Almost-Monochromatic Sets and the Chromatic Number of the PlaneNóra Frankl, Tamás Hubai, Dömötör Pálvölgyi. [doi]
• Book Embeddings of Nonplanar Graphs with Small Faces in Few PagesMichael A. Bekos, Giordano Da Lozzo, Svenja Griesbach, Martin Gronemann, Fabrizio Montecchiani, Chrysanthi N. Raftopoulou. [doi]
• Lexicographic Optimal Homologous Chains and Applications to Point Cloud TriangulationsDavid Cohen-Steiner, André Lieutier, Julien Vuillamy. [doi]
• Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge)Laurent Moalic, Dominique Schmitt, Julien Lepagnot, Julien Kritter. [doi]
• Faster Approximation Algorithms for Geometric Set CoverTimothy M. Chan, Qizheng He. [doi]
• Computing Animations of Linkages with Rotational Symmetry (Media Exposition)Sean Dewar, Georg Grasegger, Jan Legerský. [doi]
• ETH-Tight Algorithms for Long Path and Cycle on Unit Disk GraphsFedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh 0001, Meirav Zehavi. [doi]
• The Topological Correctness of PL-Approximations of IsomanifoldsJean-Daniel Boissonnat, Mathijs Wintraecken. [doi]
• Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among SegmentsHaitao Wang 0001. [doi]
• Homotopic Curve Shortening and the Affine Curve-Shortening FlowSergey Avvakumov, Gabriel Nivasch. [doi]
• Coordinated Particle Relocation with Global Signals and Local Friction (Media Exposition)Victor M. Baez, Aaron T. Becker, Sándor P. Fekete, Arne Schmidt 0001. [doi]
• Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions (CG Challenge)Günther Eder, Martin Held, Stefan de Lorenzo, Peter Palfrader. [doi]
• Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips)Uli Wagner 0001, Emo Welzl. [doi]
• Dynamic Geometric Set Cover and Hitting SetPankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, Jie Xue. [doi]
• Front Matter, Table of Contents, Preface, Conference Organization [doi]
• An Almost Optimal Bound on the Number of Intersections of Two Simple PolygonsEyal Ackerman, Balázs Keszegh, Günter Rote. [doi]
• Incidences Between Points and Curves with Almost Two Degrees of FreedomMicha Sharir, Oleg Zlydenko. [doi]
• Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge)Da-Wei Zheng, Jack Spalding-Jamieson, Brandon Zhang. [doi]
• Robust Anisotropic Power-Functions-Based Filtrations for ClusteringClaire Brécheteau. [doi]
• Geometric Secluded Paths and Planar SatisfiabilityKevin Buchin, Valentin Polishchuk, Leonid Sedov, Roman Voronov. [doi]
• Intrinsic Topological Transforms via the Distance Kernel EmbeddingClément Maria, Steve Oudot, Elchanan Solomon. [doi]
• Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and HyperrectanglesMonika Henzinger, Stefan Neumann 0003, Andreas Wiese. [doi]
• A Generalization of Self-Improving AlgorithmsSiu-Wing Cheng, Man-Kwun Chiu, Kai Jin, Man Ting Wong. [doi]
• Holes and Islands in Random Point SetsMartin Balko, Manfred Scheucher, Pavel Valtr. [doi]
• How to Make a CG Video (Media Exposition)Aaron T. Becker, Sándor P. Fekete. [doi]
• On the Planar Two-Center Problem and Circular HullsHaitao Wang 0001. [doi]
• Convex Hulls of Random Order TypesXavier Goaoc, Emo Welzl. [doi]
• The Spiroplot App (Media Exposition)Casper van Dommelen, Marc J. van Kreveld, Jérôme Urhausen. [doi]
• Fast Algorithms for Minimum Cycle Basis and Minimum Homology BasisAbhishek Rathod. [doi]
• Terrain Visibility Graphs: Persistence Is Not EnoughSafwa Ameer, Matt Gibson-Lopez, Erik Krohn, Sean Soderman, Qing Wang 0013. [doi]
• Sketched MinDistJeff M. Phillips, Pingfan Tang. [doi]
• Dimensionality Reduction for k-Distance Applied to Persistent HomologyShreya Arya, Jean-Daniel Boissonnat, Kunal Dutta, Martin Lotz. [doi]
• Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition)Tillmann Miltzow, Irene Parada, Willem Sonke, Bettina Speckmann, Jules Wulms. [doi]
• Persistence of the Conley Index in Combinatorial Dynamical SystemsTamal K. Dey, Marian Mrozek, Ryan Slechta. [doi]
• Further Results on Colored Range SearchingTimothy M. Chan, Qizheng He, Yakov Nekrich. [doi]
• Almost Sharp Bounds on the Number of Discrete Chains in the PlaneNóra Frankl, Andrey Kupavskii. [doi]
• Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial ComplexesGlencora Borradaile, William Maxwell, Amir Nayyeri. [doi]
• Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata (Media Exposition)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 0001, Christian Scheffer, Michael Yannuzzi. [doi]
• Bounded VC-Dimension Implies the Schur-Erdős ConjectureJacob Fox, János Pach, Andrew Suk. [doi]
• Elder-Rule-Staircodes for Augmented Metric SpacesChen Cai, Woojin Kim, Facundo Mémoli, Yusu Wang. [doi]
• An Efficient Algorithm for 1-Dimensional (Persistent) Path HomologyTamal K. Dey, Tianqi Li, Yusu Wang. [doi]
• The Reeb Graph Edit Distance Is UniversalUlrich Bauer, Claudia Landi, Facundo Mémoli. [doi]
• The Stretch Factor of Hexagon-Delaunay TriangulationsMichael Dennis, Ljubomir Perkovic, Duru Türkoglu. [doi]
• The Parameterized Complexity of Guarding Almost Convex PolygonsAkanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh 0001, Meirav Zehavi. [doi]
• Bounding Radon Number via Betti NumbersZuzana Patáková. [doi]
• Removing Connected Obstacles in the Plane Is FPTEduard Eiben, Daniel Lokshtanov. [doi]
• Flipping Geometric Triangulations on Hyperbolic SurfacesVincent Despré, Jean-Marc Schlenker, Monique Teillaud. [doi]
• Minimum Scan Cover with Angular Transition CostsSándor P. Fekete, Linda Kleist, Dominik Krupke. [doi]
• Dots & Polygons (Media Exposition)Kevin Buchin, Mart Hagedoorn, Irina Kostitsyna, Max van Mulken, Jolan Rensen, Leo van Schooten. [doi]
• Plane-Filling Trails (Media Exposition)Herman J. Haverkort. [doi]
• Designing Art Galleries (Media Exposition)Toon van Benthem, Kevin Buchin, Irina Kostitsyna, Stijn Slot. [doi]
• Homotopy Reconstruction via the Cech Complex and the Vietoris-Rips ComplexJisu Kim, Jaehyeok Shin, Frédéric Chazal, Alessandro Rinaldo, Larry A. Wasserman. [doi]
• Parallel Computation of Alpha Complexes for BiomoleculesTalha Bin Masood, Tathagata Ray, Vijay Natarajan. [doi]
• How to Find a Point in the Convex Hull PrivatelyHaim Kaplan, Micha Sharir, Uri Stemmer. [doi]
• Barycentric Cuts Through a Convex BodyZuzana Patáková, Martin Tancer, Uli Wagner 0001. [doi]
• Testing Polynomials for Vanishing on Cartesian Products of Planar Point SetsBoris Aronov, Esther Ezra, Micha Sharir. [doi]
• Radon Numbers Grow LinearlyDömötör Pálvölgyi. [doi]
• Edge Collapse and Persistence of Flag ComplexesJean-Daniel Boissonnat, Siddharth Pritam. [doi]
• A Quasi-Polynomial Algorithm for Well-Spaced Hyperbolic TSPSándor Kisfaludi-Bak. [doi]
• Long Alternating Paths ExistWolfgang Mulzer, Pavel Valtr. [doi]
• Relative Persistent HomologyNello Blaser, Morten Brun. [doi]
• Euclidean TSP in Narrow StripsHenk Alkema, Mark de Berg, Sándor Kisfaludi-Bak. [doi]
• Visual Demo of Discrete Stratified Morse Theory (Media Exposition)Youjia Zhou, Kevin P. Knudson, Bei Wang. [doi]
• Fast Algorithms for Geometric ConsensusesSariel Har-Peled, Mitchell Jones. [doi]
• On Implementing Straight Skeletons: Challenges and ExperiencesGünther Eder, Martin Held, Peter Palfrader. [doi]
• Covering Rectangles by Disks: The Video (Media Exposition)Sándor P. Fekete, Phillip Keldenich, Christian Scheffer. [doi]
• Empty Squares in Arbitrary Orientation Among PointsSang Won Bae, Sang Duk Yoon. [doi]
• On Rectangle-Decomposable 2-Parameter Persistence ModulesMagnus Bakke Botnan, Vadim Lebovici, Steve Oudot. [doi]
• No-Dimensional Tverberg Theorems and AlgorithmsAruni Choudhary, Wolfgang Mulzer. [doi]
• Step-By-Step Straight Skeletons (Media Exposition)Günther Eder, Martin Held, Peter Palfrader. [doi]
• A Toroidal Maxwell-Cremona-Delaunay CorrespondenceJeff Erickson 0001, Patrick Lin. [doi]
• Dense Graphs Have Rigid PartsOrit E. Raz, József Solymosi. [doi]
• Finding Closed Quasigeodesics on Convex PolyhedraErik D. Demaine, Adam Hesterberg, Jason S. Ku. [doi]
• The ε-t-Net ProblemNoga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, Yelena Yuditsky. [doi]
• Dynamic Distribution-Sensitive Point LocationSiu-Wing Cheng, Man-Kit Lau. [doi]
• Extending Drawings of Graphs to Arrangements of PseudolinesAlan Arroyo, Julien Bensmail, R. Bruce Richter. [doi]
• k-Median Clustering Under Discrete Fréchet and Hausdorff DistancesAbhinandan Nath, Erin Taylor 0002. [doi]
• Persistent Homology Based Characterization of the Breast Cancer Immune Microenvironment: A Feasibility StudyAndrew Aukerman, Mathieu Carrière, Chao Chen, Kevin Gardner, Raúl Rabadán, Rami Vanguri. [doi]
• A Near-Linear Time Approximation Scheme for Geometric Transportation with Arbitrary Supplies and SpreadKyle Fox, Jiashuai Lu. [doi]