LIPIcs, Volume 99, SoCG 2018

• Bettina Speckmann and Csaba D. Tóth LIPIcs, Volume 99, SoCG'18, Complete Volume 10.4230/LIPIcs.SoCG.2018
• Bettina Speckmann and Csaba D. Tóth Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks 10.4230/LIPIcs.SoCG.2018.0
• Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, and Ahmad A. Rushdi Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm 10.4230/LIPIcs.SoCG.2018.1
• A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, and Shakhar Smorodinsky Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs 10.4230/LIPIcs.SoCG.2018.2
• Michal Adamaszek, Henry Adams, Ellen Gasparovic, Maria Gommel, Emilie Purvine, Radmila Sazdanovic, Bei Wang, Yusu Wang, and Lori Ziegelmeier Vietoris-Rips and Cech Complexes of Metric Gluings 10.4230/LIPIcs.SoCG.2018.3
• Pankaj K. Agarwal, Lars Arge, and Frank Staals Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon 10.4230/LIPIcs.SoCG.2018.4
• Ryo Ashida and Kotaro Nakagawa O~(n^{1/3})-Space Algorithm for the Grid Graph Reachability Problem 10.4230/LIPIcs.SoCG.2018.5
• Sang Won Bae, Sergio Cabello, Otfried Cheong, Yoonsung Choi, Fabian Stehn, and Sang Duk Yoon The Reverse Kakeya Problem 10.4230/LIPIcs.SoCG.2018.6
• Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, and Kasturi Varadarajan Capacitated Covering Problems in Geometric Spaces 10.4230/LIPIcs.SoCG.2018.7
• Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Ian Munro, and Michiel Smid Faster Algorithms for some Optimization Problems on Collinear Points 10.4230/LIPIcs.SoCG.2018.8
• Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken Local Criteria for Triangulation of Manifolds 10.4230/LIPIcs.SoCG.2018.9
• Jean-Daniel Boissonnat, André Lieutier, and Mathijs Wintraecken The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces 10.4230/LIPIcs.SoCG.2018.10
• Édouard Bonnet and Panos Giannopoulos Orthogonal Terrain Guarding is NP-complete 10.4230/LIPIcs.SoCG.2018.11
• Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, and Florian Sikora QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs 10.4230/LIPIcs.SoCG.2018.12
• Håvard Bakke Bjerkevik and Magnus Bakke Botnan Computational Complexity of the Interleaving Distance 10.4230/LIPIcs.SoCG.2018.13
• Adam Brown and Bei Wang Sheaf-Theoretic Stratification Learning 10.4230/LIPIcs.SoCG.2018.14
• Mickaël Buchet and Emerson G. Escolar Realizations of Indecomposable Persistence Modules of Arbitrarily Large Dimension 10.4230/LIPIcs.SoCG.2018.15
• Kevin Buchin, Jeff M. Phillips, and Pingfan Tang Approximating the Distribution of the Median and other Robust Estimators on Uncertain Data 10.4230/LIPIcs.SoCG.2018.16
• Boris Bukh, Xavier Goaoc, Alfredo Hubard, and Matthew Trager Consistent Sets of Lines with no Colorful Incidence 10.4230/LIPIcs.SoCG.2018.17
• Benjamin A. Burton The HOMFLY-PT Polynomial is Fixed-Parameter Tractable 10.4230/LIPIcs.SoCG.2018.18
• Ludovic Calès, Apostolos Chalkis, Ioannis Z. Emiris, and Vissarion Fisikopoulos Practical Volume Computation of Structured Convex Bodies, and an Application to Modeling Portfolio Dependencies and Financial Crises 10.4230/LIPIcs.SoCG.2018.19
• Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, and Aurélien Ooms Subquadratic Encodings for Point Configurations 10.4230/LIPIcs.SoCG.2018.20
• Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Anastasios Sidiropoulos Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces 10.4230/LIPIcs.SoCG.2018.21
• Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, and Yann Vaxès Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs 10.4230/LIPIcs.SoCG.2018.22
• Timothy M. Chan Tree Drawings Revisited 10.4230/LIPIcs.SoCG.2018.23
• Timothy M. Chan and Dimitrios Skrepetos Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs 10.4230/LIPIcs.SoCG.2018.24
• Timothy M. Chan and Konstantinos Tsakalidis Dynamic Planar Orthogonal Point Location in Sublogarithmic Time 10.4230/LIPIcs.SoCG.2018.25
• Frédéric Chazal and Vincent Divol The Density of Expected Persistence Diagrams and its Kernel Based Estimation 10.4230/LIPIcs.SoCG.2018.26
• Éric Colin de Verdière, Thomas Magnard, and Bojan Mohar Embedding Graphs into Two-Dimensional Simplicial Complexes 10.4230/LIPIcs.SoCG.2018.27
• Roee David, Karthik C. S., and Bundit Laekhanukit On the Complexity of Closest Pair via Polar-Pair of Point-Sets 10.4230/LIPIcs.SoCG.2018.28
• Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer, and Henk Meijer Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch 10.4230/LIPIcs.SoCG.2018.29
• Olivier Devillers, Sylvain Lazard, and William J. Lenhart 3D Snap Rounding 10.4230/LIPIcs.SoCG.2018.30
• Tamal K. Dey, Jiayuan Wang, and Yusu Wang Graph Reconstruction by Discrete Morse Theory 10.4230/LIPIcs.SoCG.2018.31
• Tamal K. Dey and Cheng Xin Computing Bottleneck Distance for 2-D Interval Decomposable Modules 10.4230/LIPIcs.SoCG.2018.32
• Zdenek Dvorák, Petr Hlinený, and Bojan Mohar Structure and Generation of Crossing-Critical Graphs 10.4230/LIPIcs.SoCG.2018.33
• Herbert Edelsbrunner and Georg Osang The Multi-cover Persistence of Euclidean Balls 10.4230/LIPIcs.SoCG.2018.34
• Herbert Edelsbrunner, Ziga Virk, and Hubert Wagner Smallest Enclosing Spheres and Chernoff Points in BregmanGeometry 10.4230/LIPIcs.SoCG.2018.35
• Michael Elkin and Ofer Neiman Near Isometric Terminal Embeddings for Doubling Metrics 10.4230/LIPIcs.SoCG.2018.36
• Ioannis Z. Emiris and Ioannis Psarros Products of Euclidean Metrics and Applications to Proximity Questions among Curves 10.4230/LIPIcs.SoCG.2018.37
• Stefan Felsner, Linda Kleist, Torsten Mütze, and Leon Sering Rainbow Cycles in Flip Graphs 10.4230/LIPIcs.SoCG.2018.38
• Radoslav Fulek and Jan Kyncl Hanani-Tutte for Approximating Maps of Graphs 10.4230/LIPIcs.SoCG.2018.39
• Radoslav Fulek and Jan Kyncl The Z_2-Genus of Kuratowski Minors 10.4230/LIPIcs.SoCG.2018.40
• Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, and Uli Wagner Shellability is NP-Complete 10.4230/LIPIcs.SoCG.2018.41
• Arthur van Goethem and Kevin Verbeek Optimal Morphs of Planar Orthogonal Drawings 10.4230/LIPIcs.SoCG.2018.42
• Joshua A. Grochow and Jamie Tucker-Foltz Computational Topology and the Unique Games Conjecture 10.4230/LIPIcs.SoCG.2018.43
• Andreas Haas Solving Large-Scale Minimum-Weight Triangulation Instances to Provable Optimality 10.4230/LIPIcs.SoCG.2018.44
• Ivor van der Hoog, Elena Khramtcova, and Maarten Löffler Dynamic Smooth Compressed Quadtrees 10.4230/LIPIcs.SoCG.2018.45
• Kristóf Huszár, Jonathan Spreer, and Uli Wagner On the Treewidth of Triangulated 3-Manifolds 10.4230/LIPIcs.SoCG.2018.46
• Tanmay Inamdar and Kasturi Varadarajan On Partial Covering For Geometric Set Systems 10.4230/LIPIcs.SoCG.2018.47
• Bruno Jartoux and Nabil H. Mustafa Optimality of Geometric Local Search 10.4230/LIPIcs.SoCG.2018.48
• Yifei Jin, Jian Li, and Wei Zhan Odd Yao-Yao Graphs are Not Spanners 10.4230/LIPIcs.SoCG.2018.49
• Kolja Junginger and Evanthia Papadopoulou Deletion in Abstract Voronoi Diagrams in Expected Linear Time 10.4230/LIPIcs.SoCG.2018.50
• Chaya Keller and Shakhar Smorodinsky From a (p,2)-Theorem to a Tight (p,q)-Theorem 10.4230/LIPIcs.SoCG.2018.51
• Balázs Keszegh Coloring Intersection Hypergraphs of Pseudo-Disks 10.4230/LIPIcs.SoCG.2018.52
• Fabian Klute and Martin Nöllenburg Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts 10.4230/LIPIcs.SoCG.2018.53
• Kevin Knudson and Bei Wang Discrete Stratified Morse Theory: A User's Guide 10.4230/LIPIcs.SoCG.2018.54
• Irina Kostitsyna, Bahram Kouhestani, Stefan Langerman, and David Rappaport An Optimal Algorithm to Compute the Inverse Beacon Attraction Region 10.4230/LIPIcs.SoCG.2018.55
• Marc van Kreveld, Maarten Löffler, and Lionov Wiratma On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance 10.4230/LIPIcs.SoCG.2018.56
• Thijs Laarhoven Graph-Based Time-Space Trade-Offs for Approximate Near Neighbors 10.4230/LIPIcs.SoCG.2018.57
• Chih-Hung Liu A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon 10.4230/LIPIcs.SoCG.2018.58
• Leonardo Martínez-Sandoval, Edgardo Roldán-Pensado, and Natan Rubin Further Consequences of the Colorful Helly Hypothesis 10.4230/LIPIcs.SoCG.2018.59
• Malte Milatz Random Walks on Polytopes of Constant Corank 10.4230/LIPIcs.SoCG.2018.60
• Victor Milenkovic, Elisha Sacks, and Nabeel Butt Table Based Detection of Degenerate Predicates in Free Space Construction 10.4230/LIPIcs.SoCG.2018.61
• Eunjin Oh and Hee-Kap Ahn Approximate Range Queries for Clustering 10.4230/LIPIcs.SoCG.2018.62
• Eunjin Oh and Hee-Kap Ahn Point Location in Dynamic Planar Subdivisions 10.4230/LIPIcs.SoCG.2018.63
• Joseph O'Rourke Edge-Unfolding Nearly Flat Convex Caps 10.4230/LIPIcs.SoCG.2018.64
• János Pach and Géza Tóth A Crossing Lemma for Multigraphs 10.4230/LIPIcs.SoCG.2018.65
• Jeff M. Phillips and Wai Ming Tai Near-Optimal Coresets of Kernel Density Estimates 10.4230/LIPIcs.SoCG.2018.66
• Sharath Raghvendra Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line 10.4230/LIPIcs.SoCG.2018.67
• János Pach, Bruce Reed, and Yelena Yuditsky Almost All String Graphs are Intersection Graphs of Plane Convex Sets 10.4230/LIPIcs.SoCG.2018.68
• Oliver Roche-Newton An Improved Bound for the Size of the Set A/A+A 10.4230/LIPIcs.SoCG.2018.69
• Anastasios Sidiropoulos, Kritika Singhal, and Vijay Sridhar Fractal Dimension and Lower Bounds for Geometric Problems 10.4230/LIPIcs.SoCG.2018.70
• Jonathan Spreer and Stephan Tillmann The Trisection Genus of Standard Simply Connected PL 4-Manifolds 10.4230/LIPIcs.SoCG.2018.71
• Haitao Wang and Jingru Zhang An O(n log n)-Time Algorithm for the k-Center Problem in Trees 10.4230/LIPIcs.SoCG.2018.72
• Jie Xue, Yuan Li, Saladi Rahul, and Ravi Janardan New Bounds for Range Closest-Pair Problems 10.4230/LIPIcs.SoCG.2018.73
• Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Matthias Konitzny, Lillian Lin, and Christian Scheffer Coordinated Motion Planning: The Video (Multimedia Exposition) 10.4230/LIPIcs.SoCG.2018.74
• Satyan L. Devadoss, Daniel D. Johnson, Justin Lee, and Jackson Warley Geometric Realizations of the 3D Associahedron (Multimedia Exposition) 10.4230/LIPIcs.SoCG.2018.75
• Dani Demas, Satyan L. Devadoss, and Yu Xuan Hong Star Unfolding of Boxes (Multimedia Exposition) 10.4230/LIPIcs.SoCG.2018.76
• Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, and Ahmad A. Rushdi VoroCrust Illustrated: Theory and Challenges (Multimedia Exposition) 10.4230/LIPIcs.SoCG.2018.77