LIPIcs, Volume 129, SoCG 2019

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