@Proceedings{barequet_et_al:LIPIcs.SoCG.2019,
title = {{LIPIcs, Volume 129, SoCG'19, Complete Volume}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019},
URN = {urn:nbn:de:0030-drops-105562},
doi = {10.4230/LIPIcs.SoCG.2019},
annote = {Keywords: Theory of computation, Computational geometry, Design and analysis of algorithms, Mathematics of computing, Combinatorics, Graph algortihms}
}
@InProceedings{barequet_et_al:LIPIcs.SoCG.2019.0,
author = {Barequet, Gill and Wang, Yusu},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {0:i--0:xvi},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.0},
URN = {urn:nbn:de:0030-drops-104047},
doi = {10.4230/LIPIcs.SoCG.2019.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{dasgupta:LIPIcs.SoCG.2019.1,
author = {Dasgupta, Sanjoy},
title = {{A Geometric Data Structure from Neuroscience}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.1},
URN = {urn:nbn:de:0030-drops-104055},
doi = {10.4230/LIPIcs.SoCG.2019.1},
annote = {Keywords: Geometric data structure, algorithm design, neuroscience}
}
@InProceedings{donald:LIPIcs.SoCG.2019.2,
author = {Donald, Bruce R.},
title = {{Some Geometric and Computational Challenges Arising in Structural Molecular Biology}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {2:1--2:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.2},
URN = {urn:nbn:de:0030-drops-104065},
doi = {10.4230/LIPIcs.SoCG.2019.2},
annote = {Keywords: Geometric computing, combutational biology, Continuous Interdomain Orientation Distributions of Protein Conformations}
}
@InProceedings{afshani:LIPIcs.SoCG.2019.3,
author = {Afshani, Peyman},
title = {{A New Lower Bound for Semigroup Orthogonal Range Searching}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {3:1--3:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.3},
URN = {urn:nbn:de:0030-drops-104075},
doi = {10.4230/LIPIcs.SoCG.2019.3},
annote = {Keywords: Data Structures, Range Searching, Lower bounds}
}
@InProceedings{afshani_et_al:LIPIcs.SoCG.2019.4,
author = {Afshani, Peyman and Phillips, Jeff M.},
title = {{Independent Range Sampling, Revisited Again}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {4:1--4:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.4},
URN = {urn:nbn:de:0030-drops-104088},
doi = {10.4230/LIPIcs.SoCG.2019.4},
annote = {Keywords: Range Searching, Data Structures, Sampling}
}
@InProceedings{agarwal_et_al:LIPIcs.SoCG.2019.5,
author = {Agarwal, Pankaj K. and Aronov, Boris and Ezra, Esther and Zahl, Joshua},
title = {{An Efficient Algorithm for Generalized Polynomial Partitioning and Its Applications}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {5:1--5:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.5},
URN = {urn:nbn:de:0030-drops-104096},
doi = {10.4230/LIPIcs.SoCG.2019.5},
annote = {Keywords: Polynomial partitioning, quantifier elimination, semi-algebraic range spaces, epsilon-samples}
}
@InProceedings{agarwal_et_al:LIPIcs.SoCG.2019.6,
author = {Agarwal, Pankaj K. and Chang, Hsien-Chih and Xiao, Allen},
title = {{Efficient Algorithms for Geometric Partial Matching}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {6:1--6:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.6},
URN = {urn:nbn:de:0030-drops-104109},
doi = {10.4230/LIPIcs.SoCG.2019.6},
annote = {Keywords: partial matching, transportation, optimal transport, minimum-cost flow, bichromatic closest pair}
}
@InProceedings{agrawal_et_al:LIPIcs.SoCG.2019.7,
author = {Agrawal, Akanksha and Gu\'{s}piel, Grzegorz and Madathil, Jayakrishnan and Saurabh, Saket and Zehavi, Meirav},
title = {{Connecting the Dots (with Minimum Crossings)}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {7:1--7:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.7},
URN = {urn:nbn:de:0030-drops-104117},
doi = {10.4230/LIPIcs.SoCG.2019.7},
annote = {Keywords: crossing minimization, parameterized complexity, FPT algorithm, polynomial kernel, W\lbrack1\rbrack-hardness}
}
@InProceedings{aiger_et_al:LIPIcs.SoCG.2019.8,
author = {Aiger, Dror and Kaplan, Haim and Kokiopoulou, Efi and Sharir, Micha and Zeisl, Bernhard},
title = {{General Techniques for Approximate Incidences and Their Application to the Camera Posing Problem}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {8:1--8:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.8},
URN = {urn:nbn:de:0030-drops-104129},
doi = {10.4230/LIPIcs.SoCG.2019.8},
annote = {Keywords: Camera positioning, Approximate incidences, Incidences}
}
@InProceedings{akitaya_et_al:LIPIcs.SoCG.2019.9,
author = {Akitaya, Hugo A. and Korman, Matias and Rudoy, Mikhail and Souvaine, Diane L. and T\'{o}th, Csaba D.},
title = {{Circumscribing Polygons and Polygonizations for Disjoint Line Segments}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {9:1--9:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.9},
URN = {urn:nbn:de:0030-drops-104136},
doi = {10.4230/LIPIcs.SoCG.2019.9},
annote = {Keywords: circumscribing polygon, Hamiltonicity, extremal combinatorics}
}
@InProceedings{angelini_et_al:LIPIcs.SoCG.2019.10,
author = {Angelini, Patrizio and Chaplick, Steven and Cornelsen, Sabine and Da Lozzo, Giordano and Roselli, Vincenzo},
title = {{Morphing Contact Representations of Graphs}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {10:1--10:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.10},
URN = {urn:nbn:de:0030-drops-104145},
doi = {10.4230/LIPIcs.SoCG.2019.10},
annote = {Keywords: Contact representations, Triangulations, Planar morphs, Schnyder woods}
}
@InProceedings{attali_et_al:LIPIcs.SoCG.2019.11,
author = {Attali, Dominique and Lieutier, Andr\'{e} and Salinas, David},
title = {{When Convexity Helps Collapsing Complexes}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.11},
URN = {urn:nbn:de:0030-drops-104152},
doi = {10.4230/LIPIcs.SoCG.2019.11},
annote = {Keywords: collapsibility, convexity, collection of compact convex sets, nerve, filtration, Delaunay complex, Cech complex, Rips complex}
}
@InProceedings{barba:LIPIcs.SoCG.2019.12,
author = {Barba, Luis},
title = {{Optimal Algorithm for Geodesic Farthest-Point Voronoi Diagrams}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {12:1--12:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.12},
URN = {urn:nbn:de:0030-drops-104161},
doi = {10.4230/LIPIcs.SoCG.2019.12},
annote = {Keywords: Geodesic distance, simple polygons, farthest-point Voronoi diagram}
}
@InProceedings{binucci_et_al:LIPIcs.SoCG.2019.13,
author = {Binucci, Carla and Da Lozzo, Giordano and Di Giacomo, Emilio and Didimo, Walter and Mchedlidze, Tamara and Patrignani, Maurizio},
title = {{Upward Book Embeddings of st-Graphs}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {13:1--13:22},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.13},
URN = {urn:nbn:de:0030-drops-104170},
doi = {10.4230/LIPIcs.SoCG.2019.13},
annote = {Keywords: Upward Book Embeddings, st-Graphs, SPQR-trees, Branchwidth, Sphere-cut Decomposition}
}
@InProceedings{bokal_et_al:LIPIcs.SoCG.2019.14,
author = {Bokal, Drago and Dvo\v{r}\'{a}k, Zden\v{e}k and Hlin\v{e}n\'{y}, Petr and Lea\~{n}os, Jes\'{u}s and Mohar, Bojan and Wiedera, Tilo},
title = {{Bounded Degree Conjecture Holds Precisely for c-Crossing-Critical Graphs with c \langle= 12}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {14:1--14:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.14},
URN = {urn:nbn:de:0030-drops-104183},
doi = {10.4230/LIPIcs.SoCG.2019.14},
annote = {Keywords: graph drawing, crossing number, crossing-critical, zip product}
}
@InProceedings{khesin_et_al:LIPIcs.SoCG.2019.15,
author = {Khesin, Andrey Boris and Nikolov, Aleksandar and Paramonov, Dmitry},
title = {{Preconditioning for the Geometric Transportation Problem}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {15:1--15:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.15},
URN = {urn:nbn:de:0030-drops-104190},
doi = {10.4230/LIPIcs.SoCG.2019.15},
annote = {Keywords: Earth Mover Distance, Transportation Problem, Minimum Cost Flow}
}
@InProceedings{braverman_et_al:LIPIcs.SoCG.2019.16,
author = {Braverman, Vladimir and Charikar, Moses and Kuszmaul, William and Woodruff, David P. and Yang, Lin F.},
title = {{The One-Way Communication Complexity of Dynamic Time Warping Distance}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {16:1--16:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.16},
URN = {urn:nbn:de:0030-drops-104203},
doi = {10.4230/LIPIcs.SoCG.2019.16},
annote = {Keywords: dynamic time warping, one-way communication complexity, tree metrics}
}
@InProceedings{bringmann_et_al:LIPIcs.SoCG.2019.17,
author = {Bringmann, Karl and K\"{u}nnemann, Marvin and Nusser, Andr\'{e}},
title = {{Walking the Dog Fast in Practice: Algorithm Engineering of the Fr\'{e}chet Distance}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {17:1--17:21},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.17},
URN = {urn:nbn:de:0030-drops-104219},
doi = {10.4230/LIPIcs.SoCG.2019.17},
annote = {Keywords: curve simplification, Fr\'{e}chet distance, algorithm engineering}
}
@InProceedings{bringmann_et_al:LIPIcs.SoCG.2019.18,
author = {Bringmann, Karl and Chaudhury, Bhaskar Ray},
title = {{Polyline Simplification has Cubic Complexity}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {18:1--18:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.18},
URN = {urn:nbn:de:0030-drops-104224},
doi = {10.4230/LIPIcs.SoCG.2019.18},
annote = {Keywords: Polyline simplification, Fr\'{e}chet distance, Hausdorff distance, Conditional lower bounds}
}
@InProceedings{buchin_et_al:LIPIcs.SoCG.2019.19,
author = {Buchin, Kevin and Har-Peled, Sariel and Ol\'{a}h, D\'{a}niel},
title = {{A Spanner for the Day After}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {19:1--19:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.19},
URN = {urn:nbn:de:0030-drops-104237},
doi = {10.4230/LIPIcs.SoCG.2019.19},
annote = {Keywords: Geometric spanners, vertex failures, robustness}
}
@InProceedings{cabello_et_al:LIPIcs.SoCG.2019.20,
author = {Cabello, Sergio and Chan, Timothy M.},
title = {{Computing Shapley Values in the Plane}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {20:1--20:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.20},
URN = {urn:nbn:de:0030-drops-104244},
doi = {10.4230/LIPIcs.SoCG.2019.20},
annote = {Keywords: Shapley values, stochastic computational geometry, convex hull, minimum enclosing disk, bounding box, arrangements, convolutions, airport problem}
}
@InProceedings{carriere_et_al:LIPIcs.SoCG.2019.21,
author = {Carri\`{e}re, Mathieu and Bauer, Ulrich},
title = {{On the Metric Distortion of Embedding Persistence Diagrams into Separable Hilbert Spaces}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.21},
URN = {urn:nbn:de:0030-drops-104259},
doi = {10.4230/LIPIcs.SoCG.2019.21},
annote = {Keywords: Topological Data Analysis, Persistence Diagrams, Hilbert space embedding}
}
@InProceedings{decarufel_et_al:LIPIcs.SoCG.2019.22,
author = {De Carufel, Jean-Lou and Dumitrescu, Adrian and Meulemans, Wouter and Ophelders, Tim and Pennarun, Claire and T\'{o}th, Csaba D. and Verdonschot, Sander},
title = {{Convex Polygons in Cartesian Products}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {22:1--22:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.22},
URN = {urn:nbn:de:0030-drops-104267},
doi = {10.4230/LIPIcs.SoCG.2019.22},
annote = {Keywords: Erd\H{o}s-Szekeres theorem, Cartesian product, convexity, polyhedron, recursive construction, approximation algorithm}
}
@InProceedings{chan_et_al:LIPIcs.SoCG.2019.23,
author = {Chan, Timothy M. and Har-Peled, Sariel},
title = {{Smallest k-Enclosing Rectangle Revisited}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {23:1--23:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.23},
URN = {urn:nbn:de:0030-drops-104276},
doi = {10.4230/LIPIcs.SoCG.2019.23},
annote = {Keywords: Geometric optimization, outliers, approximation algorithms, conditional lower bounds}
}
@InProceedings{chan:LIPIcs.SoCG.2019.24,
author = {Chan, Timothy M.},
title = {{Dynamic Geometric Data Structures via Shallow Cuttings}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {24:1--24:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.24},
URN = {urn:nbn:de:0030-drops-104288},
doi = {10.4230/LIPIcs.SoCG.2019.24},
annote = {Keywords: dynamic data structures, convex hulls, nearest neighbor search, closest pair, shallow cuttings}
}
@InProceedings{chang_et_al:LIPIcs.SoCG.2019.25,
author = {Chang, Hsien-Chih and Cossarini, Marcos and Erickson, Jeff},
title = {{Lower Bounds for Electrical Reduction on Surfaces}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {25:1--25:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.25},
URN = {urn:nbn:de:0030-drops-104294},
doi = {10.4230/LIPIcs.SoCG.2019.25},
annote = {Keywords: electrical transformation, Delta-Y-transformation, homotopy, tight, defect, SPQR-tree, smoothings, routing set, 2-flipping}
}
@InProceedings{agarwal_et_al:LIPIcs.SoCG.2019.26,
author = {Agarwal, Pankaj K. and Cohen, Ravid and Halperin, Dan and Mulzer, Wolfgang},
title = {{Maintaining the Union of Unit Discs Under Insertions with Near-Optimal Overhead}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {26:1--26:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.26},
URN = {urn:nbn:de:0030-drops-104307},
doi = {10.4230/LIPIcs.SoCG.2019.26},
annote = {Keywords: lower envelopes, pseudo-lines, unit discs, range search, dynamic algorithms, tentative binary search}
}
@InProceedings{cohenaddad_et_al:LIPIcs.SoCG.2019.27,
author = {Cohen-Addad, Vincent and Colin de Verdi\`{e}re, \'{E}ric and Marx, D\'{a}niel and de Mesmay, Arnaud},
title = {{Almost Tight Lower Bounds for Hard Cutting Problems in Embedded Graphs}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {27:1--27:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.27},
URN = {urn:nbn:de:0030-drops-104311},
doi = {10.4230/LIPIcs.SoCG.2019.27},
annote = {Keywords: Cut graph, Multiway cut, Surface, Lower bound, Parameterized Complexity, Exponential Time Hypothesis}
}
@InProceedings{driemel_et_al:LIPIcs.SoCG.2019.28,
author = {Driemel, Anne and Phillips, Jeff M. and Psarros, Ioannis},
title = {{The VC Dimension of Metric Balls Under Fr\'{e}chet and Hausdorff Distances}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {28:1--28:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.28},
URN = {urn:nbn:de:0030-drops-104329},
doi = {10.4230/LIPIcs.SoCG.2019.28},
annote = {Keywords: VC dimension, Fr\'{e}chet distance, Hausdorff distance}
}
@InProceedings{dujmovic_et_al:LIPIcs.SoCG.2019.29,
author = {Dujmovi\'{c}, Vida and Morin, Pat},
title = {{Dual Circumference and Collinear Sets}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {29:1--29:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.29},
URN = {urn:nbn:de:0030-drops-104338},
doi = {10.4230/LIPIcs.SoCG.2019.29},
annote = {Keywords: Planar graphs, collinear sets, untangling, column planarity, universal point subsets, partial simultaneous geometric drawings}
}
@InProceedings{dumitrescu:LIPIcs.SoCG.2019.30,
author = {Dumitrescu, Adrian},
title = {{A Product Inequality for Extreme Distances}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {30:1--30:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.30},
URN = {urn:nbn:de:0030-drops-104343},
doi = {10.4230/LIPIcs.SoCG.2019.30},
annote = {Keywords: Extreme distances, repeated distances}
}
@InProceedings{edelsbrunner_et_al:LIPIcs.SoCG.2019.31,
author = {Edelsbrunner, Herbert and Virk, \v{Z}iga and Wagner, Hubert},
title = {{Topological Data Analysis in Information Space}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {31:1--31:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.31},
URN = {urn:nbn:de:0030-drops-104357},
doi = {10.4230/LIPIcs.SoCG.2019.31},
annote = {Keywords: Computational topology, persistent homology, information theory, entropy}
}
@InProceedings{eppstein:LIPIcs.SoCG.2019.32,
author = {Eppstein, David},
title = {{Cubic Planar Graphs That Cannot Be Drawn On Few Lines}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {32:1--32:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.32},
URN = {urn:nbn:de:0030-drops-104363},
doi = {10.4230/LIPIcs.SoCG.2019.32},
annote = {Keywords: graph drawing, universal point sets, collinearity}
}
@InProceedings{eppstein:LIPIcs.SoCG.2019.33,
author = {Eppstein, David},
title = {{Counting Polygon Triangulations is Hard}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {33:1--33:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.33},
URN = {urn:nbn:de:0030-drops-104371},
doi = {10.4230/LIPIcs.SoCG.2019.33},
annote = {Keywords: counting complexity, #P-completeness, triangulation, polygons}
}
@InProceedings{erickson_et_al:LIPIcs.SoCG.2019.34,
author = {Erickson, Jeff and Wang, Yipu},
title = {{Topologically Trivial Closed Walks in Directed Surface Graphs}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {34:1--34:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.34},
URN = {urn:nbn:de:0030-drops-104383},
doi = {10.4230/LIPIcs.SoCG.2019.34},
annote = {Keywords: computational topology, surface-embedded graphs, homotopy, homology, strong connectivity, hyperbolic geometry, medial axes, context-free grammars}
}
@InProceedings{fekete_et_al:LIPIcs.SoCG.2019.35,
author = {Fekete, S\'{a}ndor P. and Keldenich, Phillip and Scheffer, Christian},
title = {{Packing Disks into Disks with Optimal Worst-Case Density}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {35:1--35:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.35},
URN = {urn:nbn:de:0030-drops-104398},
doi = {10.4230/LIPIcs.SoCG.2019.35},
annote = {Keywords: Disk packing, packing density, tight worst-case bound, interval arithmetic, approximation}
}
@InProceedings{fox_et_al:LIPIcs.SoCG.2019.36,
author = {Fox, Jacob and Pach, J\'{a}nos and Suk, Andrew},
title = {{Semi-Algebraic Colorings of Complete Graphs}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {36:1--36:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.36},
URN = {urn:nbn:de:0030-drops-104401},
doi = {10.4230/LIPIcs.SoCG.2019.36},
annote = {Keywords: Semi-algebraic graphs, Ramsey theory, regularity lemma}
}
@InProceedings{fugacci_et_al:LIPIcs.SoCG.2019.37,
author = {Fugacci, Ulderico and Kerber, Michael},
title = {{Chunk Reduction for Multi-Parameter Persistent Homology}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {37:1--37:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.37},
URN = {urn:nbn:de:0030-drops-104413},
doi = {10.4230/LIPIcs.SoCG.2019.37},
annote = {Keywords: Multi-parameter persistent homology, Matrix reduction, Chain complexes}
}
@InProceedings{fulek_et_al:LIPIcs.SoCG.2019.38,
author = {Fulek, Radoslav and G\"{a}rtner, Bernd and Kupavskii, Andrey and Valtr, Pavel and Wagner, Uli},
title = {{The Crossing Tverberg Theorem}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {38:1--38:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.38},
URN = {urn:nbn:de:0030-drops-104423},
doi = {10.4230/LIPIcs.SoCG.2019.38},
annote = {Keywords: Discrete geometry, Tverberg theorem, Crossing Tverberg theorem}
}
@InProceedings{fulek_et_al:LIPIcs.SoCG.2019.39,
author = {Fulek, Radoslav and Kyn\v{c}l, Jan},
title = {{Z\underline2-Genus of Graphs and Minimum Rank of Partial Symmetric Matrices}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {39:1--39:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.39},
URN = {urn:nbn:de:0030-drops-104439},
doi = {10.4230/LIPIcs.SoCG.2019.39},
annote = {Keywords: graph genus, minimum rank of a partial matrix, Hanani-Tutte theorem, graph amalgamation}
}
@InProceedings{goaoc_et_al:LIPIcs.SoCG.2019.40,
author = {Goaoc, Xavier and Holmsen, Andreas and Nicaud, Cyril},
title = {{An Experimental Study of Forbidden Patterns in Geometric Permutations by Combinatorial Lifting}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {40:1--40:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.40},
URN = {urn:nbn:de:0030-drops-104442},
doi = {10.4230/LIPIcs.SoCG.2019.40},
annote = {Keywords: Geometric permutation, Emptiness testing of semi-algebraic sets, Computer-aided proof}
}
@InProceedings{harpeled_et_al:LIPIcs.SoCG.2019.41,
author = {Har-Peled, Sariel and Jones, Mitchell},
title = {{Journey to the Center of the Point Set}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {41:1--41:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.41},
URN = {urn:nbn:de:0030-drops-104454},
doi = {10.4230/LIPIcs.SoCG.2019.41},
annote = {Keywords: Computational geometry, Centerpoints, Random walks}
}
@InProceedings{vanderhoog_et_al:LIPIcs.SoCG.2019.42,
author = {van der Hoog, Ivor and Kostitsyna, Irina and L\"{o}ffler, Maarten and Speckmann, Bettina},
title = {{Preprocessing Ambiguous Imprecise Points}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {42:1--42:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.42},
URN = {urn:nbn:de:0030-drops-104460},
doi = {10.4230/LIPIcs.SoCG.2019.42},
annote = {Keywords: preprocessing, imprecise points, entropy, sorting, proximity structures}
}
@InProceedings{hsu_et_al:LIPIcs.SoCG.2019.43,
author = {Hsu, Ching-Hsiang and Chiang, Yi-Jen and Yap, Chee},
title = {{Rods and Rings: Soft Subdivision Planner for R^3 x S^2}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {43:1--43:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.43},
URN = {urn:nbn:de:0030-drops-104477},
doi = {10.4230/LIPIcs.SoCG.2019.43},
annote = {Keywords: Algorithmic Motion Planning, Subdivision Methods, Resolution-Exact Algorithms, Soft Predicates, Spatial Rod Robots, Spatial Ring Robots}
}
@InProceedings{huszar_et_al:LIPIcs.SoCG.2019.44,
author = {Husz\'{a}r, Krist\'{o}f and Spreer, Jonathan},
title = {{3-Manifold Triangulations with Small Treewidth}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {44:1--44:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.44},
URN = {urn:nbn:de:0030-drops-104487},
doi = {10.4230/LIPIcs.SoCG.2019.44},
annote = {Keywords: computational 3-manifold topology, fixed-parameter tractability, layered triangulations, structural graph theory, treewidth, cutwidth, Heegaard genus, lens spaces, Seifert fibered spaces}
}
@InProceedings{ihara_et_al:LIPIcs.SoCG.2019.45,
author = {Ihara, Diego and Mohammadi, Neshat and Sidiropoulos, Anastasios},
title = {{Algorithms for Metric Learning via Contrastive Embeddings}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {45:1--45:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.45},
URN = {urn:nbn:de:0030-drops-104492},
doi = {10.4230/LIPIcs.SoCG.2019.45},
annote = {Keywords: metric learning, contrastive distortion, embeddings, algorithms}
}
@InProceedings{kerber_et_al:LIPIcs.SoCG.2019.46,
author = {Kerber, Michael and Lesnick, Michael and Oudot, Steve},
title = {{Exact Computation of the Matching Distance on 2-Parameter Persistence Modules}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {46:1--46:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.46},
URN = {urn:nbn:de:0030-drops-104505},
doi = {10.4230/LIPIcs.SoCG.2019.46},
annote = {Keywords: Topological Data Analysis, Multi-Parameter Persistence, Line arrangements}
}
@InProceedings{krivosija_et_al:LIPIcs.SoCG.2019.47,
author = {Krivo\v{s}ija, Amer and Munteanu, Alexander},
title = {{Probabilistic Smallest Enclosing Ball in High Dimensions via Subgradient Sampling}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {47:1--47:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.47},
URN = {urn:nbn:de:0030-drops-104515},
doi = {10.4230/LIPIcs.SoCG.2019.47},
annote = {Keywords: geometric median, convex optimization, smallest enclosing ball, probabilistic data, support vector data description, kernel methods}
}
@InProceedings{lahn_et_al:LIPIcs.SoCG.2019.48,
author = {Lahn, Nathaniel and Raghvendra, Sharath},
title = {{A Weighted Approach to the Maximum Cardinality Bipartite Matching Problem with Applications in Geometric Settings}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {48:1--48:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.48},
URN = {urn:nbn:de:0030-drops-104528},
doi = {10.4230/LIPIcs.SoCG.2019.48},
annote = {Keywords: Bipartite matching, Bottleneck matching}
}
@InProceedings{demesmay_et_al:LIPIcs.SoCG.2019.49,
author = {de Mesmay, Arnaud and Rieck, Yo'av and Sedgwick, Eric and Tancer, Martin},
title = {{The Unbearable Hardness of Unknotting}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {49:1--49:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.49},
URN = {urn:nbn:de:0030-drops-104530},
doi = {10.4230/LIPIcs.SoCG.2019.49},
annote = {Keywords: Knot, Link, NP-hard, Reidemeister move, Unknot recognition, Unlinking number, intermediate invariants}
}
@InProceedings{mirzaei_et_al:LIPIcs.SoCG.2019.50,
author = {Mirzaei, Mozhgan and Suk, Andrew},
title = {{On Grids in Point-Line Arrangements in the Plane}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {50:1--50:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.50},
URN = {urn:nbn:de:0030-drops-104541},
doi = {10.4230/LIPIcs.SoCG.2019.50},
annote = {Keywords: Szemer\'{e}di-Trotter Theorem, Grids, Sidon sets}
}
@InProceedings{moran_et_al:LIPIcs.SoCG.2019.51,
author = {Moran, Shay and Yehudayoff, Amir},
title = {{On Weak epsilon-Nets and the Radon Number}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {51:1--51:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.51},
URN = {urn:nbn:de:0030-drops-104551},
doi = {10.4230/LIPIcs.SoCG.2019.51},
annote = {Keywords: abstract convexity, weak epsilon nets, Radon number, VC dimension, Haussler packing lemma, Kneser graphs}
}
@InProceedings{munro_et_al:LIPIcs.SoCG.2019.52,
author = {Munro, J. Ian and Nekrich, Yakov},
title = {{Dynamic Planar Point Location in External Memory}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {52:1--52:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.52},
URN = {urn:nbn:de:0030-drops-104566},
doi = {10.4230/LIPIcs.SoCG.2019.52},
annote = {Keywords: Data Structures, Dynamic Data Structures, Planar Point Location, External Memory}
}
@InProceedings{niedermann_et_al:LIPIcs.SoCG.2019.53,
author = {Niedermann, Benjamin and Rutter, Ignaz and Wolf, Matthias},
title = {{Efficient Algorithms for Ortho-Radial Graph Drawing}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {53:1--53:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.53},
URN = {urn:nbn:de:0030-drops-104572},
doi = {10.4230/LIPIcs.SoCG.2019.53},
annote = {Keywords: Graph Drawing, Ortho-Radial Graph Drawing, Ortho-Radial Representation, Topology-Shape-Metrics, Efficient Algorithms}
}
@InProceedings{pach_et_al:LIPIcs.SoCG.2019.54,
author = {Pach, J\'{a}nos and Tomon, Istv\'{a}n},
title = {{On the Chromatic Number of Disjointness Graphs of Curves}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {54:1--54:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.54},
URN = {urn:nbn:de:0030-drops-104582},
doi = {10.4230/LIPIcs.SoCG.2019.54},
annote = {Keywords: string graph, chromatic number, intersection graph}
}
@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2019.55,
author = {Boissonnat, Jean-Daniel and Pritam, Siddharth},
title = {{Computing Persistent Homology of Flag Complexes via Strong Collapses}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {55:1--55:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.55},
URN = {urn:nbn:de:0030-drops-104596},
doi = {10.4230/LIPIcs.SoCG.2019.55},
annote = {Keywords: Computational Topology, Topological Data Analysis, Strong Collapse, Persistent homology}
}
@InProceedings{schnider:LIPIcs.SoCG.2019.56,
author = {Schnider, Patrick},
title = {{Ham-Sandwich Cuts and Center Transversals in Subspaces}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {56:1--56:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.56},
URN = {urn:nbn:de:0030-drops-104609},
doi = {10.4230/LIPIcs.SoCG.2019.56},
annote = {Keywords: Ham-Sandwich cuts, center transversal, topological methods}
}
@InProceedings{tao_et_al:LIPIcs.SoCG.2019.57,
author = {Tao, Yufei and Wang, Yu},
title = {{Distribution-Sensitive Bounds on Relative Approximations of Geometric Ranges}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {57:1--57:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.57},
URN = {urn:nbn:de:0030-drops-104617},
doi = {10.4230/LIPIcs.SoCG.2019.57},
annote = {Keywords: Relative Approximation, Disagreement Coefficient, Data Summary}
}
@InProceedings{anai_et_al:LIPIcs.SoCG.2019.58,
author = {Anai, Hirokazu and Chazal, Fr\'{e}d\'{e}ric and Glisse, Marc and Ike, Yuichi and Inakoshi, Hiroya and Tinarrage, Rapha\"{e}l and Umeda, Yuhei},
title = {{DTM-Based Filtrations}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {58:1--58:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.58},
URN = {urn:nbn:de:0030-drops-104623},
doi = {10.4230/LIPIcs.SoCG.2019.58},
annote = {Keywords: Topological Data Analysis, Persistent homology}
}
@InProceedings{wang:LIPIcs.SoCG.2019.59,
author = {Wang, Haitao},
title = {{A Divide-and-Conquer Algorithm for Two-Point L\underline1 Shortest Path Queries in Polygonal Domains}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {59:1--59:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.59},
URN = {urn:nbn:de:0030-drops-104631},
doi = {10.4230/LIPIcs.SoCG.2019.59},
annote = {Keywords: shortest paths, two-point queries, L\underline1 metric, polygonal domains}
}
@InProceedings{wang_et_al:LIPIcs.SoCG.2019.60,
author = {Wang, Haitao and Xue, Jie},
title = {{Near-Optimal Algorithms for Shortest Paths in Weighted Unit-Disk Graphs}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {60:1--60:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.60},
URN = {urn:nbn:de:0030-drops-104649},
doi = {10.4230/LIPIcs.SoCG.2019.60},
annote = {Keywords: Single-source shortest paths, Weighted unit-disk graphs, Geometric graph algorithms}
}
@InProceedings{xue_et_al:LIPIcs.SoCG.2019.61,
author = {Xue, Jie and Li, Yuan and Rahul, Saladi and Janardan, Ravi},
title = {{Searching for the Closest-Pair in a Query Translate}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {61:1--61:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.61},
URN = {urn:nbn:de:0030-drops-104659},
doi = {10.4230/LIPIcs.SoCG.2019.61},
annote = {Keywords: Closest pair, Range search, Geometric data structures, Translation query}
}
@InProceedings{sharir_et_al:LIPIcs.SoCG.2019.62,
author = {Sharir, Micha and Ziv, Chen},
title = {{On the Complexity of the k-Level in Arrangements of Pseudoplanes}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {62:1--62:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.62},
URN = {urn:nbn:de:0030-drops-104662},
doi = {10.4230/LIPIcs.SoCG.2019.62},
annote = {Keywords: k-level, pseudoplanes, arrangements, three dimensions, k-sets}
}
@InProceedings{becker_et_al:LIPIcs.SoCG.2019.63,
author = {Becker, Aaron T. and Fekete, S\'{a}ndor P. and Keldenich, Phillip and Morr, Sebastian and Scheffer, Christian},
title = {{Packing Geometric Objects with Optimal Worst-Case Density}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {63:1--63:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.63},
URN = {urn:nbn:de:0030-drops-104678},
doi = {10.4230/LIPIcs.SoCG.2019.63},
annote = {Keywords: Packing, complexity, bounds, packing density}
}
@InProceedings{barequet_et_al:LIPIcs.SoCG.2019.64,
author = {Barequet, Gill and Ben-Shachar, Gil},
title = {{Properties of Minimal-Perimeter Polyominoes}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {64:1--64:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.64},
URN = {urn:nbn:de:0030-drops-104687},
doi = {10.4230/LIPIcs.SoCG.2019.64},
annote = {Keywords: Polyominoes, Perimeter, Minimal-Perimeter}
}
@InProceedings{loffler:LIPIcs.SoCG.2019.65,
author = {L\"{o}ffler, Maarten},
title = {{A Manual Comparison of Convex Hull Algorithms}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {65:1--65:2},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.65},
URN = {urn:nbn:de:0030-drops-104690},
doi = {10.4230/LIPIcs.SoCG.2019.65},
annote = {Keywords: convex hull, efficiency}
}
@InProceedings{schafer:LIPIcs.SoCG.2019.66,
author = {Sch\"{a}fer, Peter},
title = {{Fr\'{e}chet View - A Tool for Exploring Fr\'{e}chet Distance Algorithms}},
booktitle = {35th International Symposium on Computational Geometry (SoCG 2019)},
pages = {66:1--66:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-104-7},
ISSN = {1868-8969},
year = {2019},
volume = {129},
editor = {Barequet, Gill and Wang, Yusu},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2019.66},
URN = {urn:nbn:de:0030-drops-104703},
doi = {10.4230/LIPIcs.SoCG.2019.66},
annote = {Keywords: Fr\'{e}chet distance, free-space diagram, polygonal curves, simple polygons}
}
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