LIPIcs, Volume 164, SoCG 2020

• Sergio Cabello and Danny Z. Chen LIPIcs, Volume 164, SoCG 2020, Complete Volume 10.4230/LIPIcs.SoCG.2020
• Sergio Cabello and Danny Z. Chen Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.SoCG.2020.0
• Eyal Ackerman, Balázs Keszegh, and Günter Rote An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons 10.4230/LIPIcs.SoCG.2020.1
• Pankaj K. Agarwal, Hsien-Chih Chang, Subhash Suri, Allen Xiao, and Jie Xue Dynamic Geometric Set Cover and Hitting Set 10.4230/LIPIcs.SoCG.2020.2
• Akanksha Agrawal, Kristine V. K. Knudsen, Daniel Lokshtanov, Saket Saurabh, and Meirav Zehavi The Parameterized Complexity of Guarding Almost Convex Polygons 10.4230/LIPIcs.SoCG.2020.3
• Henk Alkema, Mark de Berg, and Sándor Kisfaludi-Bak Euclidean TSP in Narrow Strips 10.4230/LIPIcs.SoCG.2020.4
• Noga Alon, Bruno Jartoux, Chaya Keller, Shakhar Smorodinsky, and Yelena Yuditsky The ε-t-Net Problem 10.4230/LIPIcs.SoCG.2020.5
• Safwa Ameer, Matt Gibson-Lopez, Erik Krohn, Sean Soderman, and Qing Wang Terrain Visibility Graphs: Persistence Is Not Enough 10.4230/LIPIcs.SoCG.2020.6
• Boris Aronov, Mark de Berg, Joachim Gudmundsson, and Michael Horton On β-Plurality Points in Spatial Voting Games 10.4230/LIPIcs.SoCG.2020.7
• Boris Aronov, Esther Ezra, and Micha Sharir Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets 10.4230/LIPIcs.SoCG.2020.8
• Alan Arroyo, Julien Bensmail, and R. Bruce Richter Extending Drawings of Graphs to Arrangements of Pseudolines 10.4230/LIPIcs.SoCG.2020.9
• Shreya Arya, Jean-Daniel Boissonnat, Kunal Dutta, and Martin Lotz Dimensionality Reduction for k-Distance Applied to Persistent Homology 10.4230/LIPIcs.SoCG.2020.10
• Andrew Aukerman, Mathieu Carrière, Chao Chen, Kevin Gardner, Raúl Rabadán, and Rami Vanguri Persistent Homology Based Characterization of the Breast Cancer Immune Microenvironment: A Feasibility Study 10.4230/LIPIcs.SoCG.2020.11
• Sergey Avvakumov and Gabriel Nivasch Homotopic Curve Shortening and the Affine Curve-Shortening Flow 10.4230/LIPIcs.SoCG.2020.12
• Sang Won Bae and Sang Duk Yoon Empty Squares in Arbitrary Orientation Among Points 10.4230/LIPIcs.SoCG.2020.13
• Martin Balko, Manfred Scheucher, and Pavel Valtr Holes and Islands in Random Point Sets 10.4230/LIPIcs.SoCG.2020.14
• Ulrich Bauer, Claudia Landi, and Facundo Mémoli The Reeb Graph Edit Distance Is Universal 10.4230/LIPIcs.SoCG.2020.15
• Michael A. Bekos, Giordano Da Lozzo, Svenja M. Griesbach, Martin Gronemann, Fabrizio Montecchiani, and Chrysanthi Raftopoulou Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages 10.4230/LIPIcs.SoCG.2020.16
• Talha Bin Masood, Tathagata Ray, and Vijay Natarajan Parallel Computation of Alpha Complexes for Biomolecules 10.4230/LIPIcs.SoCG.2020.17
• Nello Blaser and Morten Brun Relative Persistent Homology 10.4230/LIPIcs.SoCG.2020.18
• Jean-Daniel Boissonnat and Siddharth Pritam Edge Collapse and Persistence of Flag Complexes 10.4230/LIPIcs.SoCG.2020.19
• Jean-Daniel Boissonnat and Mathijs Wintraecken The Topological Correctness of PL-Approximations of Isomanifolds 10.4230/LIPIcs.SoCG.2020.20
• Glencora Borradaile, William Maxwell, and Amir Nayyeri Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes 10.4230/LIPIcs.SoCG.2020.21
• Magnus Bakke Botnan, Vadim Lebovici, and Steve Oudot On Rectangle-Decomposable 2-Parameter Persistence Modules 10.4230/LIPIcs.SoCG.2020.22
• Claire Brécheteau Robust Anisotropic Power-Functions-Based Filtrations for Clustering 10.4230/LIPIcs.SoCG.2020.23
• Kevin Buchin, Valentin Polishchuk, Leonid Sedov, and Roman Voronov Geometric Secluded Paths and Planar Satisfiability 10.4230/LIPIcs.SoCG.2020.24
• Benjamin A. Burton The Next 350 Million Knots 10.4230/LIPIcs.SoCG.2020.25
• Chen Cai, Woojin Kim, Facundo Mémoli, and Yusu Wang Elder-Rule-Staircodes for Augmented Metric Spaces 10.4230/LIPIcs.SoCG.2020.26
• Timothy M. Chan and Qizheng He Faster Approximation Algorithms for Geometric Set Cover 10.4230/LIPIcs.SoCG.2020.27
• Timothy M. Chan, Qizheng He, and Yakov Nekrich Further Results on Colored Range Searching 10.4230/LIPIcs.SoCG.2020.28
• Siu-Wing Cheng, Man-Kwun Chiu, Kai Jin, and Man Ting Wong A Generalization of Self-Improving Algorithms 10.4230/LIPIcs.SoCG.2020.29
• Siu-Wing Cheng and Man-Kit Lau Dynamic Distribution-Sensitive Point Location 10.4230/LIPIcs.SoCG.2020.30
• Aruni Choudhary and Wolfgang Mulzer No-Dimensional Tverberg Theorems and Algorithms 10.4230/LIPIcs.SoCG.2020.31
• David Cohen-Steiner, André Lieutier, and Julien Vuillamy Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations 10.4230/LIPIcs.SoCG.2020.32
• Erik D. Demaine, Adam C. Hesterberg, and Jason S. Ku Finding Closed Quasigeodesics on Convex Polyhedra 10.4230/LIPIcs.SoCG.2020.33
• Michael Dennis, Ljubomir Perković, and Duru Türkoğlu The Stretch Factor of Hexagon-Delaunay Triangulations 10.4230/LIPIcs.SoCG.2020.34
• Vincent Despré, Jean-Marc Schlenker, and Monique Teillaud Flipping Geometric Triangulations on Hyperbolic Surfaces 10.4230/LIPIcs.SoCG.2020.35
• Tamal K. Dey, Tianqi Li, and Yusu Wang An Efficient Algorithm for 1-Dimensional (Persistent) Path Homology 10.4230/LIPIcs.SoCG.2020.36
• Tamal K. Dey, Marian Mrozek, and Ryan Slechta Persistence of the Conley Index in Combinatorial Dynamical Systems 10.4230/LIPIcs.SoCG.2020.37
• Günther Eder, Martin Held, and Peter Palfrader On Implementing Straight Skeletons: Challenges and Experiences 10.4230/LIPIcs.SoCG.2020.38
• Eduard Eiben and Daniel Lokshtanov Removing Connected Obstacles in the Plane Is FPT 10.4230/LIPIcs.SoCG.2020.39
• Jeff Erickson and Patrick Lin A Toroidal Maxwell-Cremona-Delaunay Correspondence 10.4230/LIPIcs.SoCG.2020.40
• Parker Evans, Brittany Terese Fasy, and Carola Wenk Combinatorial Properties of Self-Overlapping Curves and Interior Boundaries 10.4230/LIPIcs.SoCG.2020.41
• Sándor P. Fekete, Utkarsh Gupta, Phillip Keldenich, Christian Scheffer, and Sahil Shah Worst-Case Optimal Covering of Rectangles by Disks 10.4230/LIPIcs.SoCG.2020.42
• Sándor P. Fekete, Linda Kleist, and Dominik Krupke Minimum Scan Cover with Angular Transition Costs 10.4230/LIPIcs.SoCG.2020.43
• Fedor V. Fomin, Daniel Lokshtanov, Fahad Panolan, Saket Saurabh, and Meirav Zehavi ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs 10.4230/LIPIcs.SoCG.2020.44
• Kyle Fox and Jiashuai Lu A Near-Linear Time Approximation Scheme for Geometric Transportation with Arbitrary Supplies and Spread 10.4230/LIPIcs.SoCG.2020.45
• Jacob Fox, János Pach, and Andrew Suk Bounded VC-Dimension Implies the Schur-Erdős Conjecture 10.4230/LIPIcs.SoCG.2020.46
• Nóra Frankl, Tamás Hubai, and Dömötör Pálvölgyi Almost-Monochromatic Sets and the Chromatic Number of the Plane 10.4230/LIPIcs.SoCG.2020.47
• Nóra Frankl and Andrey Kupavskii Almost Sharp Bounds on the Number of Discrete Chains in the Plane 10.4230/LIPIcs.SoCG.2020.48
• Xavier Goaoc and Emo Welzl Convex Hulls of Random Order Types 10.4230/LIPIcs.SoCG.2020.49
• Sariel Har-Peled and Mitchell Jones Fast Algorithms for Geometric Consensuses 10.4230/LIPIcs.SoCG.2020.50
• Monika Henzinger, Stefan Neumann, and Andreas Wiese Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles 10.4230/LIPIcs.SoCG.2020.51
• Haim Kaplan, Micha Sharir, and Uri Stemmer How to Find a Point in the Convex Hull Privately 10.4230/LIPIcs.SoCG.2020.52
• Michael Kerber and Arnur Nigmetov Efficient Approximation of the Matching Distance for 2-Parameter Persistence 10.4230/LIPIcs.SoCG.2020.53
• Jisu Kim, Jaehyeok Shin, Frédéric Chazal, Alessandro Rinaldo, and Larry Wasserman Homotopy Reconstruction via the Cech Complex and the Vietoris-Rips Complex 10.4230/LIPIcs.SoCG.2020.54
• Sándor Kisfaludi-Bak A Quasi-Polynomial Algorithm for Well-Spaced Hyperbolic TSP 10.4230/LIPIcs.SoCG.2020.55
• Clément Maria, Steve Oudot, and Elchanan Solomon Intrinsic Topological Transforms via the Distance Kernel Embedding 10.4230/LIPIcs.SoCG.2020.56
• Wolfgang Mulzer and Pavel Valtr Long Alternating Paths Exist 10.4230/LIPIcs.SoCG.2020.57
• Abhinandan Nath and Erin Taylor k-Median Clustering Under Discrete Fréchet and Hausdorff Distances 10.4230/LIPIcs.SoCG.2020.58
• Yakov Nekrich Four-Dimensional Dominance Range Reporting in Linear Space 10.4230/LIPIcs.SoCG.2020.59
• Dömötör Pálvölgyi Radon Numbers Grow Linearly 10.4230/LIPIcs.SoCG.2020.60
• Zuzana Patáková Bounding Radon Number via Betti Numbers 10.4230/LIPIcs.SoCG.2020.61
• Zuzana Patáková, Martin Tancer, and Uli Wagner Barycentric Cuts Through a Convex Body 10.4230/LIPIcs.SoCG.2020.62
• Jeff M. Phillips and Pingfan Tang Sketched MinDist 10.4230/LIPIcs.SoCG.2020.63
• Abhishek Rathod Fast Algorithms for Minimum Cycle Basis and Minimum Homology Basis 10.4230/LIPIcs.SoCG.2020.64
• Orit E. Raz and József Solymosi Dense Graphs Have Rigid Parts 10.4230/LIPIcs.SoCG.2020.65
• Micha Sharir and Oleg Zlydenko Incidences Between Points and Curves with Almost Two Degrees of Freedom 10.4230/LIPIcs.SoCG.2020.66
• Uli Wagner and Emo Welzl Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips) 10.4230/LIPIcs.SoCG.2020.67
• Haitao Wang On the Planar Two-Center Problem and Circular Hulls 10.4230/LIPIcs.SoCG.2020.68
• Haitao Wang Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments 10.4230/LIPIcs.SoCG.2020.69
• Simon Zhang, Mengbai Xiao, and Hao Wang GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes 10.4230/LIPIcs.SoCG.2020.70
• Casper van Dommelen, Marc van Kreveld, and Jérôme Urhausen The Spiroplot App (Media Exposition) 10.4230/LIPIcs.SoCG.2020.71
• Victor M. Baez, Aaron T. Becker, Sándor P. Fekete, and Arne Schmidt Coordinated Particle Relocation with Global Signals and Local Friction (Media Exposition) 10.4230/LIPIcs.SoCG.2020.72
• Amira Abdel-Rahman, Aaron T. Becker, Daniel E. 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, and Michael Yannuzzi Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata (Media Exposition) 10.4230/LIPIcs.SoCG.2020.73
• Aaron T. Becker and Sándor P. Fekete How to Make a CG Video (Media Exposition) 10.4230/LIPIcs.SoCG.2020.74
• Sándor P. Fekete, Phillip Keldenich, and Christian Scheffer Covering Rectangles by Disks: The Video (Media Exposition) 10.4230/LIPIcs.SoCG.2020.75
• Günther Eder, Martin Held, and Peter Palfrader Step-By-Step Straight Skeletons (Media Exposition) 10.4230/LIPIcs.SoCG.2020.76
• Sean Dewar, Georg Grasegger, and Jan Legerský Computing Animations of Linkages with Rotational Symmetry (Media Exposition) 10.4230/LIPIcs.SoCG.2020.77
• Tillmann Miltzow, Irene Parada, Willem Sonke, Bettina Speckmann, and Jules Wulms Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy (Media Exposition) 10.4230/LIPIcs.SoCG.2020.78
• Kevin Buchin, Mart Hagedoorn, Irina Kostitsyna, Max van Mulken, Jolan Rensen, and Leo van Schooten Dots & Polygons (Media Exposition) 10.4230/LIPIcs.SoCG.2020.79
• Toon van Benthem, Kevin Buchin, Irina Kostitsyna, and Stijn Slot Designing Art Galleries (Media Exposition) 10.4230/LIPIcs.SoCG.2020.80
• Herman Haverkort Plane-Filling Trails (Media Exposition) 10.4230/LIPIcs.SoCG.2020.81
• Youjia Zhou, Kevin Knudson, and Bei Wang Visual Demo of Discrete Stratified Morse Theory (Media Exposition) 10.4230/LIPIcs.SoCG.2020.82
• Da Wei Zheng, Jack Spalding-Jamieson, and Brandon Zhang Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming (CG Challenge) 10.4230/LIPIcs.SoCG.2020.83
• Laurent Moalic, Dominique Schmitt, Julien Lepagnot, and Julien Kritter Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach (CG Challenge) 10.4230/LIPIcs.SoCG.2020.84
• Günther Eder, Martin Held, Stefan de Lorenzo, and Peter Palfrader Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions (CG Challenge) 10.4230/LIPIcs.SoCG.2020.85