HTML Export for SoCG 2019

Copy to Clipboard Download

<h2>LIPIcs, Volume 129, SoCG 2019</h2>
<ul>
<li>
    <span class="authors">Gill Barequet and Yusu Wang</span>
    <span class="title">LIPIcs, Volume 129, SoCG&#039;19, Complete Volume</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019">10.4230/LIPIcs.SoCG.2019</a>
</li>
<li>
    <span class="authors">Gill Barequet and Yusu Wang</span>
    <span class="title">Front Matter, Table of Contents, Preface, Conference Organization</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.0">10.4230/LIPIcs.SoCG.2019.0</a>
</li>
<li>
    <span class="authors">Sanjoy Dasgupta</span>
    <span class="title">A Geometric Data Structure from Neuroscience (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.1">10.4230/LIPIcs.SoCG.2019.1</a>
</li>
<li>
    <span class="authors">Bruce R. Donald</span>
    <span class="title">Some Geometric and Computational Challenges Arising in Structural Molecular Biology (Invited Talk)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.2">10.4230/LIPIcs.SoCG.2019.2</a>
</li>
<li>
    <span class="authors">Peyman Afshani</span>
    <span class="title">A New Lower Bound for Semigroup Orthogonal Range Searching</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.3">10.4230/LIPIcs.SoCG.2019.3</a>
</li>
<li>
    <span class="authors">Peyman Afshani and Jeff M. Phillips</span>
    <span class="title">Independent Range Sampling, Revisited Again</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.4">10.4230/LIPIcs.SoCG.2019.4</a>
</li>
<li>
    <span class="authors">Pankaj K. Agarwal, Boris Aronov, Esther Ezra, and Joshua Zahl</span>
    <span class="title">An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.5">10.4230/LIPIcs.SoCG.2019.5</a>
</li>
<li>
    <span class="authors">Pankaj K. Agarwal, Hsien-Chih Chang, and Allen Xiao</span>
    <span class="title">Efficient Algorithms for Geometric Partial Matching</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.6">10.4230/LIPIcs.SoCG.2019.6</a>
</li>
<li>
    <span class="authors">Akanksha Agrawal, Grzegorz Guśpiel, Jayakrishnan Madathil, Saket Saurabh, and Meirav Zehavi</span>
    <span class="title">Connecting the Dots (with Minimum Crossings)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.7">10.4230/LIPIcs.SoCG.2019.7</a>
</li>
<li>
    <span class="authors">Dror Aiger, Haim Kaplan, Efi Kokiopoulou, Micha Sharir, and Bernhard Zeisl</span>
    <span class="title">General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.8">10.4230/LIPIcs.SoCG.2019.8</a>
</li>
<li>
    <span class="authors">Hugo A. Akitaya, Matias Korman, Mikhail Rudoy, Diane L. Souvaine, and Csaba D. Tóth</span>
    <span class="title">Circumscribing Polygons and Polygonizations for Disjoint Line Segments</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.9">10.4230/LIPIcs.SoCG.2019.9</a>
</li>
<li>
    <span class="authors">Patrizio Angelini, Steven Chaplick, Sabine Cornelsen, Giordano Da Lozzo, and Vincenzo Roselli</span>
    <span class="title">Morphing Contact Representations of Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.10">10.4230/LIPIcs.SoCG.2019.10</a>
</li>
<li>
    <span class="authors">Dominique Attali, André Lieutier, and David Salinas</span>
    <span class="title">When Convexity Helps Collapsing Complexes</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.11">10.4230/LIPIcs.SoCG.2019.11</a>
</li>
<li>
    <span class="authors">Luis Barba</span>
    <span class="title">Optimal Algorithm for Geodesic Farthest-Point Voronoi Diagrams</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.12">10.4230/LIPIcs.SoCG.2019.12</a>
</li>
<li>
    <span class="authors">Carla Binucci, Giordano Da Lozzo, Emilio Di Giacomo, Walter Didimo, Tamara Mchedlidze, and Maurizio Patrignani</span>
    <span class="title">Upward Book Embeddings of st-Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.13">10.4230/LIPIcs.SoCG.2019.13</a>
</li>
<li>
    <span class="authors">Drago Bokal, Zdeněk Dvořák, Petr Hliněný, Jesús Leaños, Bojan Mohar, and Tilo Wiedera</span>
    <span class="title">Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c &lt;= 12</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.14">10.4230/LIPIcs.SoCG.2019.14</a>
</li>
<li>
    <span class="authors">Andrey Boris Khesin, Aleksandar Nikolov, and Dmitry Paramonov</span>
    <span class="title">Preconditioning for the Geometric Transportation Problem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.15">10.4230/LIPIcs.SoCG.2019.15</a>
</li>
<li>
    <span class="authors">Vladimir Braverman, Moses Charikar, William Kuszmaul, David P. Woodruff, and Lin F. Yang</span>
    <span class="title">The One-Way Communication Complexity of Dynamic Time Warping Distance</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.16">10.4230/LIPIcs.SoCG.2019.16</a>
</li>
<li>
    <span class="authors">Karl Bringmann, Marvin Künnemann, and André Nusser</span>
    <span class="title">Walking the Dog Fast in Practice: Algorithm Engineering of the Fréchet Distance</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.17">10.4230/LIPIcs.SoCG.2019.17</a>
</li>
<li>
    <span class="authors">Karl Bringmann and Bhaskar Ray Chaudhury</span>
    <span class="title">Polyline Simplification has Cubic Complexity</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.18">10.4230/LIPIcs.SoCG.2019.18</a>
</li>
<li>
    <span class="authors">Kevin Buchin, Sariel Har-Peled, and Dániel Oláh</span>
    <span class="title">A Spanner for the Day After</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.19">10.4230/LIPIcs.SoCG.2019.19</a>
</li>
<li>
    <span class="authors">Sergio Cabello and Timothy M. Chan</span>
    <span class="title">Computing Shapley Values in the Plane</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.20">10.4230/LIPIcs.SoCG.2019.20</a>
</li>
<li>
    <span class="authors">Mathieu Carrière and Ulrich Bauer</span>
    <span class="title">On the Metric Distortion of Embedding Persistence Diagrams into Separable Hilbert Spaces</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.21">10.4230/LIPIcs.SoCG.2019.21</a>
</li>
<li>
    <span class="authors">Jean-Lou De Carufel, Adrian Dumitrescu, Wouter Meulemans, Tim Ophelders, Claire Pennarun, Csaba D. Tóth, and Sander Verdonschot</span>
    <span class="title">Convex Polygons in Cartesian Products</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.22">10.4230/LIPIcs.SoCG.2019.22</a>
</li>
<li>
    <span class="authors">Timothy M. Chan and Sariel Har-Peled</span>
    <span class="title">Smallest k-Enclosing Rectangle Revisited</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.23">10.4230/LIPIcs.SoCG.2019.23</a>
</li>
<li>
    <span class="authors">Timothy M. Chan</span>
    <span class="title">Dynamic Geometric Data Structures via Shallow Cuttings</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.24">10.4230/LIPIcs.SoCG.2019.24</a>
</li>
<li>
    <span class="authors">Hsien-Chih Chang, Marcos Cossarini, and Jeff Erickson</span>
    <span class="title">Lower Bounds for Electrical Reduction on Surfaces</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.25">10.4230/LIPIcs.SoCG.2019.25</a>
</li>
<li>
    <span class="authors">Pankaj K. Agarwal, Ravid Cohen, Dan Halperin, and Wolfgang Mulzer</span>
    <span class="title">Maintaining the Union of Unit Discs Under Insertions with Near-Optimal Overhead</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.26">10.4230/LIPIcs.SoCG.2019.26</a>
</li>
<li>
    <span class="authors">Vincent Cohen-Addad, Éric Colin de Verdière, Dániel Marx, and Arnaud de Mesmay</span>
    <span class="title">Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.27">10.4230/LIPIcs.SoCG.2019.27</a>
</li>
<li>
    <span class="authors">Anne Driemel, Jeff M. Phillips, and Ioannis Psarros</span>
    <span class="title">The VC Dimension of Metric Balls Under Fréchet and Hausdorff Distances</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.28">10.4230/LIPIcs.SoCG.2019.28</a>
</li>
<li>
    <span class="authors">Vida Dujmović and Pat Morin</span>
    <span class="title">Dual Circumference and Collinear Sets</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.29">10.4230/LIPIcs.SoCG.2019.29</a>
</li>
<li>
    <span class="authors">Adrian Dumitrescu</span>
    <span class="title">A Product Inequality for Extreme Distances</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.30">10.4230/LIPIcs.SoCG.2019.30</a>
</li>
<li>
    <span class="authors">Herbert Edelsbrunner, Žiga Virk, and Hubert Wagner</span>
    <span class="title">Topological Data Analysis in Information Space</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.31">10.4230/LIPIcs.SoCG.2019.31</a>
</li>
<li>
    <span class="authors">David Eppstein</span>
    <span class="title">Cubic Planar Graphs That Cannot Be Drawn On Few Lines</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.32">10.4230/LIPIcs.SoCG.2019.32</a>
</li>
<li>
    <span class="authors">David Eppstein</span>
    <span class="title">Counting Polygon Triangulations is Hard</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.33">10.4230/LIPIcs.SoCG.2019.33</a>
</li>
<li>
    <span class="authors">Jeff Erickson and Yipu Wang</span>
    <span class="title">Topologically Trivial Closed Walks in Directed Surface Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.34">10.4230/LIPIcs.SoCG.2019.34</a>
</li>
<li>
    <span class="authors">Sándor P. Fekete, Phillip Keldenich, and Christian Scheffer</span>
    <span class="title">Packing Disks into Disks with Optimal Worst-Case Density</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.35">10.4230/LIPIcs.SoCG.2019.35</a>
</li>
<li>
    <span class="authors">Jacob Fox, János Pach, and Andrew Suk</span>
    <span class="title">Semi-Algebraic Colorings of Complete Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.36">10.4230/LIPIcs.SoCG.2019.36</a>
</li>
<li>
    <span class="authors">Ulderico Fugacci and Michael Kerber</span>
    <span class="title">Chunk Reduction for Multi-Parameter Persistent Homology</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.37">10.4230/LIPIcs.SoCG.2019.37</a>
</li>
<li>
    <span class="authors">Radoslav Fulek, Bernd Gärtner, Andrey Kupavskii, Pavel Valtr, and Uli Wagner</span>
    <span class="title">The Crossing Tverberg Theorem</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.38">10.4230/LIPIcs.SoCG.2019.38</a>
</li>
<li>
    <span class="authors">Radoslav Fulek and Jan Kynčl</span>
    <span class="title">Z_2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.39">10.4230/LIPIcs.SoCG.2019.39</a>
</li>
<li>
    <span class="authors">Xavier Goaoc, Andreas Holmsen, and Cyril Nicaud</span>
    <span class="title">An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.40">10.4230/LIPIcs.SoCG.2019.40</a>
</li>
<li>
    <span class="authors">Sariel Har-Peled and Mitchell Jones</span>
    <span class="title">Journey to the Center of the Point Set</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.41">10.4230/LIPIcs.SoCG.2019.41</a>
</li>
<li>
    <span class="authors">Ivor van der Hoog, Irina Kostitsyna, Maarten Löffler, and Bettina Speckmann</span>
    <span class="title">Preprocessing Ambiguous Imprecise Points</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.42">10.4230/LIPIcs.SoCG.2019.42</a>
</li>
<li>
    <span class="authors">Ching-Hsiang Hsu, Yi-Jen Chiang, and Chee Yap</span>
    <span class="title">Rods and Rings: Soft Subdivision Planner for R^3 x S^2</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.43">10.4230/LIPIcs.SoCG.2019.43</a>
</li>
<li>
    <span class="authors">Kristóf Huszár and Jonathan Spreer</span>
    <span class="title">3-Manifold Triangulations with Small Treewidth</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.44">10.4230/LIPIcs.SoCG.2019.44</a>
</li>
<li>
    <span class="authors">Diego Ihara, Neshat Mohammadi, and Anastasios Sidiropoulos</span>
    <span class="title">Algorithms for Metric Learning via Contrastive Embeddings</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.45">10.4230/LIPIcs.SoCG.2019.45</a>
</li>
<li>
    <span class="authors">Michael Kerber, Michael Lesnick, and Steve Oudot</span>
    <span class="title">Exact Computation of the Matching Distance on 2-Parameter Persistence Modules</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.46">10.4230/LIPIcs.SoCG.2019.46</a>
</li>
<li>
    <span class="authors">Amer Krivošija and Alexander Munteanu</span>
    <span class="title">Probabilistic Smallest Enclosing Ball in High Dimensions via Subgradient Sampling</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.47">10.4230/LIPIcs.SoCG.2019.47</a>
</li>
<li>
    <span class="authors">Nathaniel Lahn and Sharath Raghvendra</span>
    <span class="title">A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.48">10.4230/LIPIcs.SoCG.2019.48</a>
</li>
<li>
    <span class="authors">Arnaud de Mesmay, Yo&#039;av Rieck, Eric Sedgwick, and Martin Tancer</span>
    <span class="title">The Unbearable Hardness of Unknotting</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.49">10.4230/LIPIcs.SoCG.2019.49</a>
</li>
<li>
    <span class="authors">Mozhgan Mirzaei and Andrew Suk</span>
    <span class="title">On Grids in Point-Line Arrangements in the Plane</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.50">10.4230/LIPIcs.SoCG.2019.50</a>
</li>
<li>
    <span class="authors">Shay Moran and Amir Yehudayoff</span>
    <span class="title">On Weak epsilon-Nets and the Radon Number</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.51">10.4230/LIPIcs.SoCG.2019.51</a>
</li>
<li>
    <span class="authors">J. Ian Munro and Yakov Nekrich</span>
    <span class="title">Dynamic Planar Point Location in External Memory</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.52">10.4230/LIPIcs.SoCG.2019.52</a>
</li>
<li>
    <span class="authors">Benjamin Niedermann, Ignaz Rutter, and Matthias Wolf</span>
    <span class="title">Efficient Algorithms for Ortho-Radial Graph Drawing</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.53">10.4230/LIPIcs.SoCG.2019.53</a>
</li>
<li>
    <span class="authors">János Pach and István Tomon</span>
    <span class="title">On the Chromatic Number of Disjointness Graphs of Curves</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.54">10.4230/LIPIcs.SoCG.2019.54</a>
</li>
<li>
    <span class="authors">Jean-Daniel Boissonnat and Siddharth Pritam</span>
    <span class="title">Computing Persistent Homology of Flag Complexes via Strong Collapses</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.55">10.4230/LIPIcs.SoCG.2019.55</a>
</li>
<li>
    <span class="authors">Patrick Schnider</span>
    <span class="title">Ham-Sandwich Cuts and Center Transversals in Subspaces</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.56">10.4230/LIPIcs.SoCG.2019.56</a>
</li>
<li>
    <span class="authors">Yufei Tao and Yu Wang</span>
    <span class="title">Distribution-Sensitive Bounds on Relative Approximations of Geometric Ranges</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.57">10.4230/LIPIcs.SoCG.2019.57</a>
</li>
<li>
    <span class="authors">Hirokazu Anai, Frédéric Chazal, Marc Glisse, Yuichi Ike, Hiroya Inakoshi, Raphaël Tinarrage, and Yuhei Umeda</span>
    <span class="title">DTM-Based Filtrations</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.58">10.4230/LIPIcs.SoCG.2019.58</a>
</li>
<li>
    <span class="authors">Haitao Wang</span>
    <span class="title">A Divide-and-Conquer Algorithm for Two-Point L_1 Shortest Path Queries in Polygonal Domains</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.59">10.4230/LIPIcs.SoCG.2019.59</a>
</li>
<li>
    <span class="authors">Haitao Wang and Jie Xue</span>
    <span class="title">Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.60">10.4230/LIPIcs.SoCG.2019.60</a>
</li>
<li>
    <span class="authors">Jie Xue, Yuan Li, Saladi Rahul, and Ravi Janardan</span>
    <span class="title">Searching for the Closest-Pair in a Query Translate</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.61">10.4230/LIPIcs.SoCG.2019.61</a>
</li>
<li>
    <span class="authors">Micha Sharir and Chen Ziv</span>
    <span class="title">On the Complexity of the k-Level in Arrangements of Pseudoplanes</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.62">10.4230/LIPIcs.SoCG.2019.62</a>
</li>
<li>
    <span class="authors">Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Sebastian Morr, and Christian Scheffer</span>
    <span class="title">Packing Geometric Objects with Optimal Worst-Case Density (Multimedia Exposition)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.63">10.4230/LIPIcs.SoCG.2019.63</a>
</li>
<li>
    <span class="authors">Gill Barequet and Gil Ben-Shachar</span>
    <span class="title">Properties of Minimal-Perimeter Polyominoes (Multimedia Exposition)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.64">10.4230/LIPIcs.SoCG.2019.64</a>
</li>
<li>
    <span class="authors">Maarten Löffler</span>
    <span class="title">A Manual Comparison of Convex Hull Algorithms (Multimedia Exposition)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.65">10.4230/LIPIcs.SoCG.2019.65</a>
</li>
<li>
    <span class="authors">Peter Schäfer</span>
    <span class="title">Fréchet View - A Tool for Exploring Fréchet Distance Algorithms (Multimedia Exposition)</span>
    <a class="doi" href="https://doi.org/10.4230/LIPIcs.SoCG.2019.66">10.4230/LIPIcs.SoCG.2019.66</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