LIPIcs, Volume 34, SoCG 2015

• Lars Arge and János Pach LIPIcs, Volume 34, SoCG'15, Complete Volume 10.4230/LIPIcs.SOCG.2015
• Lars Arge and János Pach Front Matter, Table of Contents, Preface, Conference Organization 10.4230/LIPIcs.SOCG.2015.i
• Jirí Matoušek and Aleksandar Nikolov Combinatorial Discrepancy for Boxes via the gamma_2 Norm 10.4230/LIPIcs.SOCG.2015.1
• Aaron T. Becker, Erik D. Demaine, Sándor P. Fekete, Hamed Mohtasham Shad, and Rose Morris-Wright Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals 10.4230/LIPIcs.SOCG.2015.16
• Gill Barequet and Mira Shalah Automatic Proofs for Formulae Enumerating Proper Polycubes 10.4230/LIPIcs.SOCG.2015.19
• Nicholas J. Cavanna, Mahmoodreza Jahanseir, and Donald R. Sheehy Visualizing Sparse Filtrations 10.4230/LIPIcs.SOCG.2015.23
• Topi Talvitie Visualizing Quickest Visibility Maps 10.4230/LIPIcs.SOCG.2015.26
• Zeev Dvir and Guangda Hu Sylvester-Gallai for Arrangements of Subspaces 10.4230/LIPIcs.SOCG.2015.29
• Wolfgang Mulzer and Yannik Stein Computational Aspects of the Colorful Carathéodory Theorem 10.4230/LIPIcs.SOCG.2015.44
• Andrew Suk Semi-algebraic Ramsey Numbers 10.4230/LIPIcs.SOCG.2015.59
• Oliver Roche-Newton A Short Proof of a Near-Optimal Cardinality Estimate for the Product of a Sum Set 10.4230/LIPIcs.SOCG.2015.74
• Menelaos I. Karavelas and Eleni Tzanaki A Geometric Approach for the Upper Bound Theorem for Minkowski Sums of Convex Polytopes 10.4230/LIPIcs.SOCG.2015.81
• Kunal Dutta, Esther Ezra, and Arijit Ghosh Two Proofs for Shallow Packings 10.4230/LIPIcs.SOCG.2015.96
• Sariel Har-Peled Shortest Path in a Polygon using Sublinear Space 10.4230/LIPIcs.SOCG.2015.111
• Patrizio Angelini, Giordano Da Lozzo, Fabrizio Frati, Anna Lubiw, Maurizio Patrignani, and Vincenzo Roselli Optimal Morphs of Convex Drawings 10.4230/LIPIcs.SOCG.2015.126
• Therese Biedl and Martin Derka 1-String B_2-VPG Representation of Planar Graphs 10.4230/LIPIcs.SOCG.2015.141
• Haim Kaplan, Wolfgang Mulzer, Liam Roditty, and Paul Seiferth Spanners and Reachability Oracles for Directed Transmission Graphs 10.4230/LIPIcs.SOCG.2015.156
• Jean Cardinal and Udo Hoffmann Recognition and Complexity of Point Visibility Graphs 10.4230/LIPIcs.SOCG.2015.171
• Mohammad Ali Abam, Marjan Adeli, Hamid Homapour, and Pooya Zafar Asadollahpoor Geometric Spanners for Points Inside a Polygonal Domain 10.4230/LIPIcs.SOCG.2015.186
• Mikkel Abrahamsen An Optimal Algorithm for the Separating Common Tangents of Two Polygons 10.4230/LIPIcs.SOCG.2015.198
• Hee Kap Ahn, Luis Barba, Prosenjit Bose, Jean-Lou De Carufel, Matias Korman, and Eunjin Oh A Linear-Time Algorithm for the Geodesic Center of a Simple Polygon 10.4230/LIPIcs.SOCG.2015.209
• Olivier Devillers, Marc Glisse, Xavier Goaoc, and Rémy Thomasse On the Smoothed Complexity of Convex Hulls 10.4230/LIPIcs.SOCG.2015.224
• Drago Bokal, Sergio Cabello, and David Eppstein Finding All Maximal Subsequences with Hereditary Properties 10.4230/LIPIcs.SOCG.2015.240
• Ramsay Dyer, Gert Vegter, and Mathijs Wintraecken Riemannian Simplices and Triangulations 10.4230/LIPIcs.SOCG.2015.255
• Benjamin A. Burton and William Pettersson An Edge-Based Framework for Enumerating 3-Manifold Triangulations 10.4230/LIPIcs.SOCG.2015.270
• Alexander Pilz and Emo Welzl Order on Order Types 10.4230/LIPIcs.SOCG.2015.285
• Xavier Goaoc, Alfredo Hubard, Rémi de Joannis de Verclos, Jean-Sébastien Sereni, and Jan Volec Limits of Order Types 10.4230/LIPIcs.SOCG.2015.300
• Komei Fukuda, Bernd Gärtner, and May Szedlák Combinatorial Redundancy Detection 10.4230/LIPIcs.SOCG.2015.315
• Vincent Cohen-Addad and Claire Mathieu Effectiveness of Local Search for Geometric Optimization 10.4230/LIPIcs.SOCG.2015.329
• Daniel Dadush and Nicolai Hähnle On the Shadow Simplex Method for Curved Polyhedra 10.4230/LIPIcs.SOCG.2015.345
• Ho-Lin Chen, David Doty, Ján Manuch, Arash Rafiey, and Ladislav Stacho Pattern Overlap Implies Runaway Growth in Hierarchical Tile Systems 10.4230/LIPIcs.SOCG.2015.360
• Sariel Har-Peled, Nirman Kumar, David M. Mount, and Benjamin Raichel Space Exploration via Proximity Search 10.4230/LIPIcs.SOCG.2015.374
• Stephen Kiazyk and Anna Lubiw Star Unfolding from a Geodesic Curve 10.4230/LIPIcs.SOCG.2015.390
• Ben J. Green The Dirac-Motzkin Problem on Ordinary Lines and the Orchard Problem (Invited Talk) 10.4230/LIPIcs.SOCG.2015.405
• Martin Balko, Vít Jelínek, Pavel Valtr, and Bartosz Walczak On the Beer Index of Convexity and Its Variants 10.4230/LIPIcs.SOCG.2015.406
• Frank Hoffmann, Klaus Kriegel, Subhash Suri, Kevin Verbeek, and Max Willert Tight Bounds for Conflict-Free Chromatic Guarding of Orthogonal Art Galleries 10.4230/LIPIcs.SOCG.2015.421
• Evangelos Anagnostopoulos, Ioannis Z. Emiris, and Ioannis Psarros Low-Quality Dimension Reduction and High-Dimensional Approximate Nearest Neighbor 10.4230/LIPIcs.SOCG.2015.436
• Zeyuan Allen-Zhu, Rati Gelashvili, and Ilya Razenshteyn Restricted Isometry Property for General p-Norms 10.4230/LIPIcs.SOCG.2015.451
• Ulrich Bauer, Elizabeth Munch, and Yusu Wang Strong Equivalence of the Interleaving and Functional Distortion Metrics for Reeb Graphs 10.4230/LIPIcs.SOCG.2015.461
• Xavier Goaoc, Isaac Mabillard, Pavel Paták, Zuzana Patáková, Martin Tancer, and Uli Wagner On Generalized Heawood Inequalities for Manifolds: A Van Kampen-Flores-type Nonembeddability Result 10.4230/LIPIcs.SOCG.2015.476
• Tamal K. Dey, Dayu Shi, and Yusu Wang Comparing Graphs via Persistence Distortion 10.4230/LIPIcs.SOCG.2015.491
• Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, and Uli Wagner Bounding Helly Numbers via Betti Numbers 10.4230/LIPIcs.SOCG.2015.507
• Orit E. Raz, Micha Sharir, and Frank de Zeeuw Polynomials Vanishing on Cartesian Products: The Elekes-Szabó Theorem Revisited 10.4230/LIPIcs.SOCG.2015.522
• Ben Lund, Adam Sheffer, and Frank de Zeeuw Bisector Energy and Few Distinct Distances 10.4230/LIPIcs.SOCG.2015.537
• Micha Sharir and Noam Solomon Incidences between Points and Lines in Three Dimensions 10.4230/LIPIcs.SOCG.2015.553
• Orit E. Raz and Micha Sharir The Number of Unit-Area Triangles in the Plane: Theme and Variations 10.4230/LIPIcs.SOCG.2015.569
• Zeev Dvir and Sivakanth Gopi On the Number of Rich Lines in Truly High Dimensional Sets 10.4230/LIPIcs.SOCG.2015.584
• Michael Gene Dobbins, Andreas Holmsen, and Alfredo Hubard Realization Spaces of Arrangements of Convex Bodies 10.4230/LIPIcs.SOCG.2015.599
• Mayank Goswami, Xianfeng Gu, Vamsi P. Pingali, and Gaurish Telang Computing Teichmüller Maps between Polygons 10.4230/LIPIcs.SOCG.2015.615
• Stefan Felsner, Piotr Micek, and Torsten Ueckerdt On-line Coloring between Two Lines 10.4230/LIPIcs.SOCG.2015.630
• Jean-Daniel Boissonnat, Karthik C. S., and Sébastien Tavenas Building Efficient and Compact Data Structures for Simplicial Complexes 10.4230/LIPIcs.SOCG.2015.642
• Esther M. Arkin, Alon Efrat, Christian Knauer, Joseph S. B. Mitchell, Valentin Polishchuk, Günter Rote, Lena Schlipf, and Topi Talvitie Shortest Path to a Segment and Quickest Visibility Queries 10.4230/LIPIcs.SOCG.2015.658
• Irina Kostitsyna, Marc van Kreveld, Maarten Löffler, Bettina Speckmann, and Frank Staals Trajectory Grouping Structure under Geodesic Distance 10.4230/LIPIcs.SOCG.2015.674
• Hsien-Chih Chang, Sariel Har-Peled, and Benjamin Raichel From Proximity to Utility: A Voronoi Partition of Pareto Optima 10.4230/LIPIcs.SOCG.2015.689
• Daniel Dadush Faster Deterministic Volume Estimation in the Oracle Model via Thin Lattice Coverings 10.4230/LIPIcs.SOCG.2015.704
• Timothy M. Chan and Konstantinos Tsakalidis Optimal Deterministic Algorithms for 2-d and 3-d Shallow Cuttings 10.4230/LIPIcs.SOCG.2015.719
• Timothy M. Chan A Simpler Linear-Time Algorithm for Intersecting Two Convex Polyhedra in Three Dimensions 10.4230/LIPIcs.SOCG.2015.733
• Karl Bringmann and Wolfgang Mulzer Approximability of the Discrete Fréchet Distance 10.4230/LIPIcs.SOCG.2015.739
• Pranjal Awasthi, Moses Charikar, Ravishankar Krishnaswamy, and Ali Kemal Sinop The Hardness of Approximation of Euclidean k-Means 10.4230/LIPIcs.SOCG.2015.754
• Rolf Klein, Elmar Langetepe, and Christos Levcopoulos A Fire Fighter’s Problem 10.4230/LIPIcs.SOCG.2015.768
• Sunil Arya, David M. Mount, and Eunhui Park Approximate Geometric MST Range Queries 10.4230/LIPIcs.SOCG.2015.781
• Pankaj K. Agarwal, Thomas Mølhave, Morten Revsbæk, Issam Safa, Yusu Wang, and Jungwoo Yang Maintaining Contour Trees of Dynamic Terrains 10.4230/LIPIcs.SOCG.2015.796
• Arie Bos and Herman J. Haverkort Hyperorthogonal Well-Folded Hilbert Curves 10.4230/LIPIcs.SOCG.2015.812
• Mickaël Buchet, Frédéric Chazal, Tamal K. Dey, Fengtao Fan, Steve Y. Oudot, and Yusu Wang Topological Analysis of Scalar Fields with Outliers 10.4230/LIPIcs.SOCG.2015.827
• Peter Franek and Marek Krcál On Computability and Triviality of Well Groups 10.4230/LIPIcs.SOCG.2015.842
• Jeff M. Phillips, Bei Wang, and Yan Zheng Geometric Inference on Kernel Density Estimates 10.4230/LIPIcs.SOCG.2015.857
• Susanne Albers Modeling Real-World Data Sets (Invited Talk) 10.4230/LIPIcs.SOCG.2015.872