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