34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@Proceedings{speckmann_et_al:LIPIcs.SoCG.2018, title = {{LIPIcs, Volume 99, SoCG'18, Complete Volume}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018}, URN = {urn:nbn:de:0030-drops-89308}, doi = {10.4230/LIPIcs.SoCG.2018}, annote = {Keywords: Theory of computation, Computational geometry, Mathematics of computing, Combinatorics, Theory of computation, Design and analysis of algorithms} }
34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 0:i-0:xi, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{speckmann_et_al:LIPIcs.SoCG.2018.0, author = {Speckmann, Bettina and T\'{o}th, Csaba D.}, title = {{Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {0:i--0:xi}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.0}, URN = {urn:nbn:de:0030-drops-87136}, doi = {10.4230/LIPIcs.SoCG.2018.0}, annote = {Keywords: Front Matter, Table of Contents, Foreword, Conference Organization, Additional Reviewers, Acknowledgement of Support, Invited Talks} }
Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, and Ahmad A. Rushdi. Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 1:1-1:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{abdelkader_et_al:LIPIcs.SoCG.2018.1, author = {Abdelkader, Ahmed and Bajaj, Chandrajit L. and Ebeida, Mohamed S. and Mahmoud, Ahmed H. and Mitchell, Scott A. and Owens, John D. and Rushdi, Ahmad A.}, title = {{Sampling Conditions for Conforming Voronoi Meshing by the VoroCrust Algorithm}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {1:1--1:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.1}, URN = {urn:nbn:de:0030-drops-87147}, doi = {10.4230/LIPIcs.SoCG.2018.1}, annote = {Keywords: sampling conditions, surface reconstruction, polyhedral meshing, Voronoi} }
A. Karim Abu-Affash, Paz Carmi, Anil Maheshwari, Pat Morin, Michiel Smid, and Shakhar Smorodinsky. Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 2:1-2:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{abuaffash_et_al:LIPIcs.SoCG.2018.2, author = {Abu-Affash, A. Karim and Carmi, Paz and Maheshwari, Anil and Morin, Pat and Smid, Michiel and Smorodinsky, Shakhar}, title = {{Approximating Maximum Diameter-Bounded Subgraph in Unit Disk Graphs}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {2:1--2:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.2}, URN = {urn:nbn:de:0030-drops-87152}, doi = {10.4230/LIPIcs.SoCG.2018.2}, annote = {Keywords: Approximation algorithms, maximum diameter-bounded subgraph, unit disk graphs, fractional Helly theorem, VC-dimension} }
Michal Adamaszek, Henry Adams, Ellen Gasparovic, Maria Gommel, Emilie Purvine, Radmila Sazdanovic, Bei Wang, Yusu Wang, and Lori Ziegelmeier. Vietoris-Rips and Cech Complexes of Metric Gluings. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 3:1-3:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{adamaszek_et_al:LIPIcs.SoCG.2018.3, author = {Adamaszek, Michal and Adams, Henry and Gasparovic, Ellen and Gommel, Maria and Purvine, Emilie and Sazdanovic, Radmila and Wang, Bei and Wang, Yusu and Ziegelmeier, Lori}, title = {{Vietoris-Rips and Cech Complexes of Metric Gluings}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {3:1--3:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.3}, URN = {urn:nbn:de:0030-drops-87162}, doi = {10.4230/LIPIcs.SoCG.2018.3}, annote = {Keywords: Vietoris-Rips and Cech complexes, metric space gluings and wedge sums, metric graphs, persistent homology} }
Pankaj K. Agarwal, Lars Arge, and Frank Staals. Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 4:1-4:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{agarwal_et_al:LIPIcs.SoCG.2018.4, author = {Agarwal, Pankaj K. and Arge, Lars and Staals, Frank}, title = {{Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {4:1--4:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.4}, URN = {urn:nbn:de:0030-drops-87175}, doi = {10.4230/LIPIcs.SoCG.2018.4}, annote = {Keywords: data structure, simple polygon, geodesic distance, nearest neighbor searching, shallow cutting} }
Ryo Ashida and Kotaro Nakagawa. O~(n^{1/3})-Space Algorithm for the Grid Graph Reachability Problem. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 5:1-5:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{ashida_et_al:LIPIcs.SoCG.2018.5, author = {Ashida, Ryo and Nakagawa, Kotaro}, title = {{O\textasciitilde(n^\{1/3\})-Space Algorithm for the Grid Graph Reachability Problem}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {5:1--5:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.5}, URN = {urn:nbn:de:0030-drops-87182}, doi = {10.4230/LIPIcs.SoCG.2018.5}, annote = {Keywords: graph reachability, grid graph, graph algorithm, sublinear space algorithm} }
Sang Won Bae, Sergio Cabello, Otfried Cheong, Yoonsung Choi, Fabian Stehn, and Sang Duk Yoon. The Reverse Kakeya Problem. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 6:1-6:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bae_et_al:LIPIcs.SoCG.2018.6, author = {Bae, Sang Won and Cabello, Sergio and Cheong, Otfried and Choi, Yoonsung and Stehn, Fabian and Yoon, Sang Duk}, title = {{The Reverse Kakeya Problem}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {6:1--6:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.6}, URN = {urn:nbn:de:0030-drops-87199}, doi = {10.4230/LIPIcs.SoCG.2018.6}, annote = {Keywords: Kakeya problem, convex, isodynamic point, turning} }
Sayan Bandyapadhyay, Santanu Bhowmick, Tanmay Inamdar, and Kasturi Varadarajan. Capacitated Covering Problems in Geometric Spaces. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 7:1-7:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bandyapadhyay_et_al:LIPIcs.SoCG.2018.7, author = {Bandyapadhyay, Sayan and Bhowmick, Santanu and Inamdar, Tanmay and Varadarajan, Kasturi}, title = {{Capacitated Covering Problems in Geometric Spaces}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {7:1--7:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.7}, URN = {urn:nbn:de:0030-drops-87205}, doi = {10.4230/LIPIcs.SoCG.2018.7}, annote = {Keywords: Capacitated covering, Geometric set cover, LP rounding, Bi-criteria approximation} }
Ahmad Biniaz, Prosenjit Bose, Paz Carmi, Anil Maheshwari, Ian Munro, and Michiel Smid. Faster Algorithms for some Optimization Problems on Collinear Points. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 8:1-8:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{biniaz_et_al:LIPIcs.SoCG.2018.8, author = {Biniaz, Ahmad and Bose, Prosenjit and Carmi, Paz and Maheshwari, Anil and Munro, Ian and Smid, Michiel}, title = {{Faster Algorithms for some Optimization Problems on Collinear Points}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {8:1--8:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.8}, URN = {urn:nbn:de:0030-drops-87219}, doi = {10.4230/LIPIcs.SoCG.2018.8}, annote = {Keywords: collinear points, range assignment} }
Jean-Daniel Boissonnat, Ramsay Dyer, Arijit Ghosh, and Mathijs Wintraecken. Local Criteria for Triangulation of Manifolds. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 9:1-9:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2018.9, author = {Boissonnat, Jean-Daniel and Dyer, Ramsay and Ghosh, Arijit and Wintraecken, Mathijs}, title = {{Local Criteria for Triangulation of Manifolds}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {9:1--9:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.9}, URN = {urn:nbn:de:0030-drops-87224}, doi = {10.4230/LIPIcs.SoCG.2018.9}, annote = {Keywords: manifold, simplicial complex, homeomorphism, triangulation} }
Jean-Daniel Boissonnat, André Lieutier, and Mathijs Wintraecken. The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 10:1-10:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2018.10, author = {Boissonnat, Jean-Daniel and Lieutier, Andr\'{e} and Wintraecken, Mathijs}, title = {{The Reach, Metric Distortion, Geodesic Convexity and the Variation of Tangent Spaces}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {10:1--10:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.10}, URN = {urn:nbn:de:0030-drops-87236}, doi = {10.4230/LIPIcs.SoCG.2018.10}, annote = {Keywords: Reach, Metric distortion, Manifolds, Convexity} }
Édouard Bonnet and Panos Giannopoulos. Orthogonal Terrain Guarding is NP-complete. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bonnet_et_al:LIPIcs.SoCG.2018.11, author = {Bonnet, \'{E}douard and Giannopoulos, Panos}, title = {{Orthogonal Terrain Guarding is NP-complete}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {11:1--11:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.11}, URN = {urn:nbn:de:0030-drops-87246}, doi = {10.4230/LIPIcs.SoCG.2018.11}, annote = {Keywords: terrain guarding, rectilinear terrain, computational complexity} }
Édouard Bonnet, Panos Giannopoulos, Eun Jung Kim, Pawel Rzazewski, and Florian Sikora. QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 12:1-12:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bonnet_et_al:LIPIcs.SoCG.2018.12, author = {Bonnet, \'{E}douard and Giannopoulos, Panos and Kim, Eun Jung and Rzazewski, Pawel and Sikora, Florian}, title = {{QPTAS and Subexponential Algorithm for Maximum Clique on Disk Graphs}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {12:1--12:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.12}, URN = {urn:nbn:de:0030-drops-87259}, doi = {10.4230/LIPIcs.SoCG.2018.12}, annote = {Keywords: disk graph, maximum clique, computational complexity} }
Håvard Bakke Bjerkevik and Magnus Bakke Botnan. Computational Complexity of the Interleaving Distance. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bjerkevik_et_al:LIPIcs.SoCG.2018.13, author = {Bjerkevik, H\r{a}vard Bakke and Botnan, Magnus Bakke}, title = {{Computational Complexity of the Interleaving Distance}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {13:1--13:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.13}, URN = {urn:nbn:de:0030-drops-87268}, doi = {10.4230/LIPIcs.SoCG.2018.13}, annote = {Keywords: Persistent Homology, Interleavings, NP-hard} }
Adam Brown and Bei Wang. Sheaf-Theoretic Stratification Learning. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 14:1-14:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{brown_et_al:LIPIcs.SoCG.2018.14, author = {Brown, Adam and Wang, Bei}, title = {{Sheaf-Theoretic Stratification Learning}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {14:1--14:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.14}, URN = {urn:nbn:de:0030-drops-87270}, doi = {10.4230/LIPIcs.SoCG.2018.14}, annote = {Keywords: Sheaf theory, stratification learning, topological data analysis, stratification} }
Mickaël Buchet and Emerson G. Escolar. Realizations of Indecomposable Persistence Modules of Arbitrarily Large Dimension. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 15:1-15:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{buchet_et_al:LIPIcs.SoCG.2018.15, author = {Buchet, Micka\"{e}l and Escolar, Emerson G.}, title = {{Realizations of Indecomposable Persistence Modules of Arbitrarily Large Dimension}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {15:1--15:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.15}, URN = {urn:nbn:de:0030-drops-87287}, doi = {10.4230/LIPIcs.SoCG.2018.15}, annote = {Keywords: persistent homology, multi-persistence, representation theory, quivers, commutative ladders, Vietoris-Rips filtration} }
Kevin Buchin, Jeff M. Phillips, and Pingfan Tang. Approximating the Distribution of the Median and other Robust Estimators on Uncertain Data. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 16:1-16:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{buchin_et_al:LIPIcs.SoCG.2018.16, author = {Buchin, Kevin and Phillips, Jeff M. and Tang, Pingfan}, title = {{Approximating the Distribution of the Median and other Robust Estimators on Uncertain Data}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {16:1--16:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.16}, URN = {urn:nbn:de:0030-drops-87292}, doi = {10.4230/LIPIcs.SoCG.2018.16}, annote = {Keywords: Uncertain Data, Robust Estimators, Geometric Median, Tukey Median} }
Boris Bukh, Xavier Goaoc, Alfredo Hubard, and Matthew Trager. Consistent Sets of Lines with no Colorful Incidence. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 17:1-17:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{bukh_et_al:LIPIcs.SoCG.2018.17, author = {Bukh, Boris and Goaoc, Xavier and Hubard, Alfredo and Trager, Matthew}, title = {{Consistent Sets of Lines with no Colorful Incidence}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {17:1--17:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.17}, URN = {urn:nbn:de:0030-drops-87308}, doi = {10.4230/LIPIcs.SoCG.2018.17}, annote = {Keywords: Incidence geometry, image consistency, probabilistic construction, algebraic construction, projective configuration} }
Benjamin A. Burton. The HOMFLY-PT Polynomial is Fixed-Parameter Tractable. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 18:1-18:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{burton:LIPIcs.SoCG.2018.18, author = {Burton, Benjamin A.}, title = {{The HOMFLY-PT Polynomial is Fixed-Parameter Tractable}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {18:1--18:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.18}, URN = {urn:nbn:de:0030-drops-87311}, doi = {10.4230/LIPIcs.SoCG.2018.18}, annote = {Keywords: Knot theory, knot invariants, parameterised complexity} }
Ludovic Calès, Apostolos Chalkis, Ioannis Z. Emiris, and Vissarion Fisikopoulos. Practical Volume Computation of Structured Convex Bodies, and an Application to Modeling Portfolio Dependencies and Financial Crises. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 19:1-19:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{cales_et_al:LIPIcs.SoCG.2018.19, author = {Cal\`{e}s, Ludovic and Chalkis, Apostolos and Emiris, Ioannis Z. and Fisikopoulos, Vissarion}, title = {{Practical Volume Computation of Structured Convex Bodies, and an Application to Modeling Portfolio Dependencies and Financial Crises}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {19:1--19:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.19}, URN = {urn:nbn:de:0030-drops-87328}, doi = {10.4230/LIPIcs.SoCG.2018.19}, annote = {Keywords: Polytope volume, convex body, simplex, sampling, financial portfolio} }
Jean Cardinal, Timothy M. Chan, John Iacono, Stefan Langerman, and Aurélien Ooms. Subquadratic Encodings for Point Configurations. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 20:1-20:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{cardinal_et_al:LIPIcs.SoCG.2018.20, author = {Cardinal, Jean and Chan, Timothy M. and Iacono, John and Langerman, Stefan and Ooms, Aur\'{e}lien}, title = {{Subquadratic Encodings for Point Configurations}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {20:1--20:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.20}, URN = {urn:nbn:de:0030-drops-87337}, doi = {10.4230/LIPIcs.SoCG.2018.20}, annote = {Keywords: point configuration, order type, chirotope, succinct data structure} }
Timothy Carpenter, Fedor V. Fomin, Daniel Lokshtanov, Saket Saurabh, and Anastasios Sidiropoulos. Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 21:1-21:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{carpenter_et_al:LIPIcs.SoCG.2018.21, author = {Carpenter, Timothy and Fomin, Fedor V. and Lokshtanov, Daniel and Saurabh, Saket and Sidiropoulos, Anastasios}, title = {{Algorithms for Low-Distortion Embeddings into Arbitrary 1-Dimensional Spaces}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {21:1--21:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.21}, URN = {urn:nbn:de:0030-drops-87344}, doi = {10.4230/LIPIcs.SoCG.2018.21}, annote = {Keywords: Metric embeddings, minimum-distortion embeddings, 1-dimensional simplicial complex, Fixed-parameter tractable algorithms, Approximation algorithms} }
Jérémie Chalopin, Victor Chepoi, Feodor F. Dragan, Guillaume Ducoffe, Abdulhakeem Mohammed, and Yann Vaxès. Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 22:1-22:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chalopin_et_al:LIPIcs.SoCG.2018.22, author = {Chalopin, J\'{e}r\'{e}mie and Chepoi, Victor and Dragan, Feodor F. and Ducoffe, Guillaume and Mohammed, Abdulhakeem and Vax\`{e}s, Yann}, title = {{Fast Approximation and Exact Computation of Negative Curvature Parameters of Graphs}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {22:1--22:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.22}, URN = {urn:nbn:de:0030-drops-87356}, doi = {10.4230/LIPIcs.SoCG.2018.22}, annote = {Keywords: Gromov hyperbolicity, Graphs, Geodesic metric spaces, Approximation algorithms} }
Timothy M. Chan. Tree Drawings Revisited. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 23:1-23:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chan:LIPIcs.SoCG.2018.23, author = {Chan, Timothy M.}, title = {{Tree Drawings Revisited}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {23:1--23:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.23}, URN = {urn:nbn:de:0030-drops-87364}, doi = {10.4230/LIPIcs.SoCG.2018.23}, annote = {Keywords: graph drawing, trees, recursion} }
Timothy M. Chan and Dimitrios Skrepetos. Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 24:1-24:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chan_et_al:LIPIcs.SoCG.2018.24, author = {Chan, Timothy M. and Skrepetos, Dimitrios}, title = {{Approximate Shortest Paths and Distance Oracles in Weighted Unit-Disk Graphs}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {24:1--24:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.24}, URN = {urn:nbn:de:0030-drops-87375}, doi = {10.4230/LIPIcs.SoCG.2018.24}, annote = {Keywords: shortest paths, distance oracles, unit-disk graphs, planar graphs} }
Timothy M. Chan and Konstantinos Tsakalidis. Dynamic Planar Orthogonal Point Location in Sublogarithmic Time. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 25:1-25:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chan_et_al:LIPIcs.SoCG.2018.25, author = {Chan, Timothy M. and Tsakalidis, Konstantinos}, title = {{Dynamic Planar Orthogonal Point Location in Sublogarithmic Time}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {25:1--25:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.25}, URN = {urn:nbn:de:0030-drops-87382}, doi = {10.4230/LIPIcs.SoCG.2018.25}, annote = {Keywords: dynamic data structures, point location, word RAM} }
Frédéric Chazal and Vincent Divol. The Density of Expected Persistence Diagrams and its Kernel Based Estimation. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 26:1-26:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{chazal_et_al:LIPIcs.SoCG.2018.26, author = {Chazal, Fr\'{e}d\'{e}ric and Divol, Vincent}, title = {{The Density of Expected Persistence Diagrams and its Kernel Based Estimation}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {26:1--26:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.26}, URN = {urn:nbn:de:0030-drops-87395}, doi = {10.4230/LIPIcs.SoCG.2018.26}, annote = {Keywords: topological data analysis, persistence diagrams, subanalytic geometry} }
Éric Colin de Verdière, Thomas Magnard, and Bojan Mohar. Embedding Graphs into Two-Dimensional Simplicial Complexes. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 27:1-27:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{verdiere_et_al:LIPIcs.SoCG.2018.27, author = {Verdi\`{e}re, \'{E}ric Colin de and Magnard, Thomas and Mohar, Bojan}, title = {{Embedding Graphs into Two-Dimensional Simplicial Complexes}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {27:1--27:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.27}, URN = {urn:nbn:de:0030-drops-87401}, doi = {10.4230/LIPIcs.SoCG.2018.27}, annote = {Keywords: computational topology, embedding, simplicial complex, graph, surface} }
Roee David, Karthik C. S., and Bundit Laekhanukit. On the Complexity of Closest Pair via Polar-Pair of Point-Sets. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 28:1-28:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{david_et_al:LIPIcs.SoCG.2018.28, author = {David, Roee and C. S., Karthik and Laekhanukit, Bundit}, title = {{On the Complexity of Closest Pair via Polar-Pair of Point-Sets}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {28:1--28:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.28}, URN = {urn:nbn:de:0030-drops-87412}, doi = {10.4230/LIPIcs.SoCG.2018.28}, annote = {Keywords: Contact dimension, Sphericity, Closest Pair, Fine-Grained Complexity} }
Erik D. Demaine, Sándor P. Fekete, Phillip Keldenich, Christian Scheffer, and Henk Meijer. Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 29:1-29:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{demaine_et_al:LIPIcs.SoCG.2018.29, author = {Demaine, Erik D. and Fekete, S\'{a}ndor P. and Keldenich, Phillip and Scheffer, Christian and Meijer, Henk}, title = {{Coordinated Motion Planning: Reconfiguring a Swarm of Labeled Robots with Bounded Stretch}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {29:1--29:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.29}, URN = {urn:nbn:de:0030-drops-87423}, doi = {10.4230/LIPIcs.SoCG.2018.29}, annote = {Keywords: Robot swarms, coordinated motion planning, parallel motion, makespan, bounded stretch, complexity, approximation} }
Olivier Devillers, Sylvain Lazard, and William J. Lenhart. 3D Snap Rounding. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 30:1-30:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{devillers_et_al:LIPIcs.SoCG.2018.30, author = {Devillers, Olivier and Lazard, Sylvain and Lenhart, William J.}, title = {{3D Snap Rounding}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {30:1--30:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.30}, URN = {urn:nbn:de:0030-drops-87438}, doi = {10.4230/LIPIcs.SoCG.2018.30}, annote = {Keywords: Geometric algorithms, Robustness, Fixed-precision computations} }
Tamal K. Dey, Jiayuan Wang, and Yusu Wang. Graph Reconstruction by Discrete Morse Theory. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 31:1-31:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dey_et_al:LIPIcs.SoCG.2018.31, author = {Dey, Tamal K. and Wang, Jiayuan and Wang, Yusu}, title = {{Graph Reconstruction by Discrete Morse Theory}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {31:1--31:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.31}, URN = {urn:nbn:de:0030-drops-87443}, doi = {10.4230/LIPIcs.SoCG.2018.31}, annote = {Keywords: graph reconstruction, discrete Morse theory, persistence} }
Tamal K. Dey and Cheng Xin. Computing Bottleneck Distance for 2-D Interval Decomposable Modules. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 32:1-32:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dey_et_al:LIPIcs.SoCG.2018.32, author = {Dey, Tamal K. and Xin, Cheng}, title = {{Computing Bottleneck Distance for 2-D Interval Decomposable Modules}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {32:1--32:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.32}, URN = {urn:nbn:de:0030-drops-87453}, doi = {10.4230/LIPIcs.SoCG.2018.32}, annote = {Keywords: Persistence modules, bottleneck distance, interleaving distance} }
Zdenek Dvorák, Petr Hlinený, and Bojan Mohar. Structure and Generation of Crossing-Critical Graphs. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 33:1-33:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{dvorak_et_al:LIPIcs.SoCG.2018.33, author = {Dvor\'{a}k, Zdenek and Hlinen\'{y}, Petr and Mohar, Bojan}, title = {{Structure and Generation of Crossing-Critical Graphs}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {33:1--33:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.33}, URN = {urn:nbn:de:0030-drops-87460}, doi = {10.4230/LIPIcs.SoCG.2018.33}, annote = {Keywords: crossing number, crossing-critical, path-width, exhaustive generation} }
Herbert Edelsbrunner and Georg Osang. The Multi-cover Persistence of Euclidean Balls. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 34:1-34:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{edelsbrunner_et_al:LIPIcs.SoCG.2018.34, author = {Edelsbrunner, Herbert and Osang, Georg}, title = {{The Multi-cover Persistence of Euclidean Balls}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {34:1--34:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.34}, URN = {urn:nbn:de:0030-drops-87471}, doi = {10.4230/LIPIcs.SoCG.2018.34}, annote = {Keywords: Delaunay mosaics, hyperplane arrangements, discrete Morse theory, zigzag modules, persistent homology} }
Herbert Edelsbrunner, Ziga Virk, and Hubert Wagner. Smallest Enclosing Spheres and Chernoff Points in BregmanGeometry. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 35:1-35:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{edelsbrunner_et_al:LIPIcs.SoCG.2018.35, author = {Edelsbrunner, Herbert and Virk, Ziga and Wagner, Hubert}, title = {{Smallest Enclosing Spheres and Chernoff Points in BregmanGeometry}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {35:1--35:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.35}, URN = {urn:nbn:de:0030-drops-87487}, doi = {10.4230/LIPIcs.SoCG.2018.35}, annote = {Keywords: Bregman divergence, smallest enclosing spheres, Chernoff points, convexity, barycenter polytopes} }
Michael Elkin and Ofer Neiman. Near Isometric Terminal Embeddings for Doubling Metrics. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 36:1-36:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{elkin_et_al:LIPIcs.SoCG.2018.36, author = {Elkin, Michael and Neiman, Ofer}, title = {{Near Isometric Terminal Embeddings for Doubling Metrics}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {36:1--36:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.36}, URN = {urn:nbn:de:0030-drops-87498}, doi = {10.4230/LIPIcs.SoCG.2018.36}, annote = {Keywords: metric embedding, spanners, doubling metrics} }
Ioannis Z. Emiris and Ioannis Psarros. Products of Euclidean Metrics and Applications to Proximity Questions among Curves. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 37:1-37:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{emiris_et_al:LIPIcs.SoCG.2018.37, author = {Emiris, Ioannis Z. and Psarros, Ioannis}, title = {{Products of Euclidean Metrics and Applications to Proximity Questions among Curves}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {37:1--37:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.37}, URN = {urn:nbn:de:0030-drops-87504}, doi = {10.4230/LIPIcs.SoCG.2018.37}, annote = {Keywords: Approximate nearest neighbor, polygonal curves, Fr\'{e}chet distance, dynamic time warping} }
Stefan Felsner, Linda Kleist, Torsten Mütze, and Leon Sering. Rainbow Cycles in Flip Graphs. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 38:1-38:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{felsner_et_al:LIPIcs.SoCG.2018.38, author = {Felsner, Stefan and Kleist, Linda and M\"{u}tze, Torsten and Sering, Leon}, title = {{Rainbow Cycles in Flip Graphs}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {38:1--38:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.38}, URN = {urn:nbn:de:0030-drops-87514}, doi = {10.4230/LIPIcs.SoCG.2018.38}, annote = {Keywords: flip graph, cycle, rainbow, Gray code, triangulation, spanning tree, matching, permutation, subset, combination} }
Radoslav Fulek and Jan Kyncl. Hanani-Tutte for Approximating Maps of Graphs. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 39:1-39:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{fulek_et_al:LIPIcs.SoCG.2018.39, author = {Fulek, Radoslav and Kyncl, Jan}, title = {{Hanani-Tutte for Approximating Maps of Graphs}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {39:1--39:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.39}, URN = {urn:nbn:de:0030-drops-87527}, doi = {10.4230/LIPIcs.SoCG.2018.39}, annote = {Keywords: Hanani-Tutte theorem, graph embedding, map approximation, weak embedding, clustered planarity} }
Radoslav Fulek and Jan Kyncl. The Z_2-Genus of Kuratowski Minors. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 40:1-40:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{fulek_et_al:LIPIcs.SoCG.2018.40, author = {Fulek, Radoslav and Kyncl, Jan}, title = {{The Z\underline2-Genus of Kuratowski Minors}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {40:1--40:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.40}, URN = {urn:nbn:de:0030-drops-87539}, doi = {10.4230/LIPIcs.SoCG.2018.40}, annote = {Keywords: Hanani-Tutte theorem, genus of a graph, Z\underline2-genus of a graph, Kuratowski graph} }
Xavier Goaoc, Pavel Paták, Zuzana Patáková, Martin Tancer, and Uli Wagner. Shellability is NP-Complete. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 41:1-41:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{goaoc_et_al:LIPIcs.SoCG.2018.41, author = {Goaoc, Xavier and Pat\'{a}k, Pavel and Pat\'{a}kov\'{a}, Zuzana and Tancer, Martin and Wagner, Uli}, title = {{Shellability is NP-Complete}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {41:1--41:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.41}, URN = {urn:nbn:de:0030-drops-87542}, doi = {10.4230/LIPIcs.SoCG.2018.41}, annote = {Keywords: Shellability, simplicial complexes, NP-completeness, collapsibility} }
Arthur van Goethem and Kevin Verbeek. Optimal Morphs of Planar Orthogonal Drawings. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 42:1-42:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{vangoethem_et_al:LIPIcs.SoCG.2018.42, author = {van Goethem, Arthur and Verbeek, Kevin}, title = {{Optimal Morphs of Planar Orthogonal Drawings}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {42:1--42:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.42}, URN = {urn:nbn:de:0030-drops-87550}, doi = {10.4230/LIPIcs.SoCG.2018.42}, annote = {Keywords: Homotopy, Morphing, Orthogonal drawing, Spirality} }
Joshua A. Grochow and Jamie Tucker-Foltz. Computational Topology and the Unique Games Conjecture. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 43:1-43:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{grochow_et_al:LIPIcs.SoCG.2018.43, author = {Grochow, Joshua A. and Tucker-Foltz, Jamie}, title = {{Computational Topology and the Unique Games Conjecture}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {43:1--43:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.43}, URN = {urn:nbn:de:0030-drops-87566}, doi = {10.4230/LIPIcs.SoCG.2018.43}, annote = {Keywords: Unique Games Conjecture, homology localization, inapproximability, computational topology, graph lift, covering graph, permutation voltage graph, cell} }
Andreas Haas. Solving Large-Scale Minimum-Weight Triangulation Instances to Provable Optimality. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 44:1-44:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{haas:LIPIcs.SoCG.2018.44, author = {Haas, Andreas}, title = {{Solving Large-Scale Minimum-Weight Triangulation Instances to Provable Optimality}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {44:1--44:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.44}, URN = {urn:nbn:de:0030-drops-87576}, doi = {10.4230/LIPIcs.SoCG.2018.44}, annote = {Keywords: computational geometry, minimum-weight triangulation} }
Ivor van der Hoog, Elena Khramtcova, and Maarten Löffler. Dynamic Smooth Compressed Quadtrees. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 45:1-45:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{vanderhoog_et_al:LIPIcs.SoCG.2018.45, author = {van der Hoog, Ivor and Khramtcova, Elena and L\"{o}ffler, Maarten}, title = {{Dynamic Smooth Compressed Quadtrees}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {45:1--45:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.45}, URN = {urn:nbn:de:0030-drops-87581}, doi = {10.4230/LIPIcs.SoCG.2018.45}, annote = {Keywords: smooth, dynamic, data structure, quadtree, compression, alignment, Real RAM} }
Kristóf Huszár, Jonathan Spreer, and Uli Wagner. On the Treewidth of Triangulated 3-Manifolds. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 46:1-46:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{huszar_et_al:LIPIcs.SoCG.2018.46, author = {Husz\'{a}r, Krist\'{o}f and Spreer, Jonathan and Wagner, Uli}, title = {{On the Treewidth of Triangulated 3-Manifolds}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {46:1--46:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.46}, URN = {urn:nbn:de:0030-drops-87591}, doi = {10.4230/LIPIcs.SoCG.2018.46}, annote = {Keywords: computational topology, triangulations of 3-manifolds, thin position, fixed-parameter tractability, congestion, treewidth} }
Tanmay Inamdar and Kasturi Varadarajan. On Partial Covering For Geometric Set Systems. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 47:1-47:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{inamdar_et_al:LIPIcs.SoCG.2018.47, author = {Inamdar, Tanmay and Varadarajan, Kasturi}, title = {{On Partial Covering For Geometric Set Systems}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {47:1--47:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.47}, URN = {urn:nbn:de:0030-drops-87607}, doi = {10.4230/LIPIcs.SoCG.2018.47}, annote = {Keywords: Partial Set Cover, Geometric Set Cover} }
Bruno Jartoux and Nabil H. Mustafa. Optimality of Geometric Local Search. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 48:1-48:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{jartoux_et_al:LIPIcs.SoCG.2018.48, author = {Jartoux, Bruno and Mustafa, Nabil H.}, title = {{Optimality of Geometric Local Search}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {48:1--48:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.48}, URN = {urn:nbn:de:0030-drops-87615}, doi = {10.4230/LIPIcs.SoCG.2018.48}, annote = {Keywords: local search, expansion, matchings, Hall's marriage theorem} }
Yifei Jin, Jian Li, and Wei Zhan. Odd Yao-Yao Graphs are Not Spanners. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 49:1-49:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{jin_et_al:LIPIcs.SoCG.2018.49, author = {Jin, Yifei and Li, Jian and Zhan, Wei}, title = {{Odd Yao-Yao Graphs are Not Spanners}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {49:1--49:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.49}, URN = {urn:nbn:de:0030-drops-87621}, doi = {10.4230/LIPIcs.SoCG.2018.49}, annote = {Keywords: Odd Yao-Yao Graph, Spanner, Counterexample} }
Kolja Junginger and Evanthia Papadopoulou. Deletion in Abstract Voronoi Diagrams in Expected Linear Time. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 50:1-50:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{junginger_et_al:LIPIcs.SoCG.2018.50, author = {Junginger, Kolja and Papadopoulou, Evanthia}, title = {{Deletion in Abstract Voronoi Diagrams in Expected Linear Time}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {50:1--50:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.50}, URN = {urn:nbn:de:0030-drops-87639}, doi = {10.4230/LIPIcs.SoCG.2018.50}, annote = {Keywords: Abstract Voronoi diagram, linear-time algorithm, update after deletion, randomized incremental algorithm} }
Chaya Keller and Shakhar Smorodinsky. From a (p,2)-Theorem to a Tight (p,q)-Theorem. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 51:1-51:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{keller_et_al:LIPIcs.SoCG.2018.51, author = {Keller, Chaya and Smorodinsky, Shakhar}, title = {{From a (p,2)-Theorem to a Tight (p,q)-Theorem}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {51:1--51:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.51}, URN = {urn:nbn:de:0030-drops-87640}, doi = {10.4230/LIPIcs.SoCG.2018.51}, annote = {Keywords: (p,q)-Theorem, convexity, transversals, (p,2)-theorem, axis-parallel rectangles} }
Balázs Keszegh. Coloring Intersection Hypergraphs of Pseudo-Disks. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 52:1-52:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{keszegh:LIPIcs.SoCG.2018.52, author = {Keszegh, Bal\'{a}zs}, title = {{Coloring Intersection Hypergraphs of Pseudo-Disks}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {52:1--52:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.52}, URN = {urn:nbn:de:0030-drops-87657}, doi = {10.4230/LIPIcs.SoCG.2018.52}, annote = {Keywords: combinatorial geometry, conflict-free coloring, geometric hypergraph coloring} }
Fabian Klute and Martin Nöllenburg. Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 53:1-53:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{klute_et_al:LIPIcs.SoCG.2018.53, author = {Klute, Fabian and N\"{o}llenburg, Martin}, title = {{Minimizing Crossings in Constrained Two-Sided Circular Graph Layouts}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {53:1--53:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.53}, URN = {urn:nbn:de:0030-drops-87663}, doi = {10.4230/LIPIcs.SoCG.2018.53}, annote = {Keywords: Graph Drawing, Circular Layouts, Crossing Minimization, Circle Graphs, Bounded-Degree Maximum-Weight Induced Subgraphs} }
Kevin Knudson and Bei Wang. Discrete Stratified Morse Theory: A User's Guide. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 54:1-54:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{knudson_et_al:LIPIcs.SoCG.2018.54, author = {Knudson, Kevin and Wang, Bei}, title = {{Discrete Stratified Morse Theory: A User's Guide}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {54:1--54:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.54}, URN = {urn:nbn:de:0030-drops-87671}, doi = {10.4230/LIPIcs.SoCG.2018.54}, annote = {Keywords: Discrete Morse theory, stratified Morse theory, topological data analysis} }
Irina Kostitsyna, Bahram Kouhestani, Stefan Langerman, and David Rappaport. An Optimal Algorithm to Compute the Inverse Beacon Attraction Region. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 55:1-55:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{kostitsyna_et_al:LIPIcs.SoCG.2018.55, author = {Kostitsyna, Irina and Kouhestani, Bahram and Langerman, Stefan and Rappaport, David}, title = {{An Optimal Algorithm to Compute the Inverse Beacon Attraction Region}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {55:1--55:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.55}, URN = {urn:nbn:de:0030-drops-87686}, doi = {10.4230/LIPIcs.SoCG.2018.55}, annote = {Keywords: beacon attraction, inverse attraction region, algorithm, optimal} }
Marc van Kreveld, Maarten Löffler, and Lionov Wiratma. On Optimal Polyline Simplification Using the Hausdorff and Fréchet Distance. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 56:1-56:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{vankreveld_et_al:LIPIcs.SoCG.2018.56, author = {van Kreveld, Marc and L\"{o}ffler, Maarten and Wiratma, Lionov}, title = {{On Optimal Polyline Simplification Using the Hausdorff and Fr\'{e}chet Distance}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {56:1--56:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.56}, URN = {urn:nbn:de:0030-drops-87694}, doi = {10.4230/LIPIcs.SoCG.2018.56}, annote = {Keywords: polygonal line simplification, Hausdorff distance, Fr\'{e}chet distance, Imai-Iri, Douglas-Peucker} }
Thijs Laarhoven. Graph-Based Time-Space Trade-Offs for Approximate Near Neighbors. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 57:1-57:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{laarhoven:LIPIcs.SoCG.2018.57, author = {Laarhoven, Thijs}, title = {{Graph-Based Time-Space Trade-Offs for Approximate Near Neighbors}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {57:1--57:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.57}, URN = {urn:nbn:de:0030-drops-87700}, doi = {10.4230/LIPIcs.SoCG.2018.57}, annote = {Keywords: approximate nearest neighbor problem, near neighbor graphs, locality-sensitive hashing, locality-sensitive filters, similarity search} }
Chih-Hung Liu. A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 58:1-58:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{liu:LIPIcs.SoCG.2018.58, author = {Liu, Chih-Hung}, title = {{A Nearly Optimal Algorithm for the Geodesic Voronoi Diagram of Points in a Simple Polygon}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {58:1--58:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.58}, URN = {urn:nbn:de:0030-drops-87717}, doi = {10.4230/LIPIcs.SoCG.2018.58}, annote = {Keywords: Simple polygons, Voronoi diagrams, Geodesic distance} }
Leonardo Martínez-Sandoval, Edgardo Roldán-Pensado, and Natan Rubin. Further Consequences of the Colorful Helly Hypothesis. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 59:1-59:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{martinezsandoval_et_al:LIPIcs.SoCG.2018.59, author = {Mart{\'\i}nez-Sandoval, Leonardo and Rold\'{a}n-Pensado, Edgardo and Rubin, Natan}, title = {{Further Consequences of the Colorful Helly Hypothesis}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {59:1--59:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.59}, URN = {urn:nbn:de:0030-drops-87726}, doi = {10.4230/LIPIcs.SoCG.2018.59}, annote = {Keywords: geometric transversals, convex sets, colorful Helly-type theorems, line transversals, weak epsilon-nets, transversal numbers} }
Malte Milatz. Random Walks on Polytopes of Constant Corank. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 60:1-60:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{milatz:LIPIcs.SoCG.2018.60, author = {Milatz, Malte}, title = {{Random Walks on Polytopes of Constant Corank}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {60:1--60:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.60}, URN = {urn:nbn:de:0030-drops-87730}, doi = {10.4230/LIPIcs.SoCG.2018.60}, annote = {Keywords: polytope, unique sink orientation, grid, random walk} }
Victor Milenkovic, Elisha Sacks, and Nabeel Butt. Table Based Detection of Degenerate Predicates in Free Space Construction. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 61:1-61:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{milenkovic_et_al:LIPIcs.SoCG.2018.61, author = {Milenkovic, Victor and Sacks, Elisha and Butt, Nabeel}, title = {{Table Based Detection of Degenerate Predicates in Free Space Construction}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {61:1--61:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.61}, URN = {urn:nbn:de:0030-drops-87749}, doi = {10.4230/LIPIcs.SoCG.2018.61}, annote = {Keywords: free space construction, degenerate predicates, robustness} }
Eunjin Oh and Hee-Kap Ahn. Approximate Range Queries for Clustering. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 62:1-62:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{oh_et_al:LIPIcs.SoCG.2018.62, author = {Oh, Eunjin and Ahn, Hee-Kap}, title = {{Approximate Range Queries for Clustering}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {62:1--62:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.62}, URN = {urn:nbn:de:0030-drops-87755}, doi = {10.4230/LIPIcs.SoCG.2018.62}, annote = {Keywords: Approximate clustering, orthogonal range queries} }
Eunjin Oh and Hee-Kap Ahn. Point Location in Dynamic Planar Subdivisions. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 63:1-63:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{oh_et_al:LIPIcs.SoCG.2018.63, author = {Oh, Eunjin and Ahn, Hee-Kap}, title = {{Point Location in Dynamic Planar Subdivisions}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {63:1--63:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.63}, URN = {urn:nbn:de:0030-drops-87769}, doi = {10.4230/LIPIcs.SoCG.2018.63}, annote = {Keywords: dynamic point location, general subdivision} }
Joseph O'Rourke. Edge-Unfolding Nearly Flat Convex Caps. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 64:1-64:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{orourke:LIPIcs.SoCG.2018.64, author = {O'Rourke, Joseph}, title = {{Edge-Unfolding Nearly Flat Convex Caps}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {64:1--64:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.64}, URN = {urn:nbn:de:0030-drops-87777}, doi = {10.4230/LIPIcs.SoCG.2018.64}, annote = {Keywords: polyhedra, unfolding} }
János Pach and Géza Tóth. A Crossing Lemma for Multigraphs. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 65:1-65:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{pach_et_al:LIPIcs.SoCG.2018.65, author = {Pach, J\'{a}nos and T\'{o}th, G\'{e}za}, title = {{A Crossing Lemma for Multigraphs}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {65:1--65:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.65}, URN = {urn:nbn:de:0030-drops-87781}, doi = {10.4230/LIPIcs.SoCG.2018.65}, annote = {Keywords: crossing number, Crossing Lemma, multigraph, separator theorem} }
Jeff M. Phillips and Wai Ming Tai. Near-Optimal Coresets of Kernel Density Estimates. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 66:1-66:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{phillips_et_al:LIPIcs.SoCG.2018.66, author = {Phillips, Jeff M. and Tai, Wai Ming}, title = {{Near-Optimal Coresets of Kernel Density Estimates}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {66:1--66:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.66}, URN = {urn:nbn:de:0030-drops-87797}, doi = {10.4230/LIPIcs.SoCG.2018.66}, annote = {Keywords: Coresets, Kernel Density Estimate, Discrepancy} }
Sharath Raghvendra. Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 67:1-67:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{raghvendra:LIPIcs.SoCG.2018.67, author = {Raghvendra, Sharath}, title = {{Optimal Analysis of an Online Algorithm for the Bipartite Matching Problem on a Line}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {67:1--67:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.67}, URN = {urn:nbn:de:0030-drops-87803}, doi = {10.4230/LIPIcs.SoCG.2018.67}, annote = {Keywords: Bipartite Matching, Online Algorithms, Adversarial Model, Line Metric} }
János Pach, Bruce Reed, and Yelena Yuditsky. Almost All String Graphs are Intersection Graphs of Plane Convex Sets. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 68:1-68:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{pach_et_al:LIPIcs.SoCG.2018.68, author = {Pach, J\'{a}nos and Reed, Bruce and Yuditsky, Yelena}, title = {{Almost All String Graphs are Intersection Graphs of Plane Convex Sets}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {68:1--68:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.68}, URN = {urn:nbn:de:0030-drops-87818}, doi = {10.4230/LIPIcs.SoCG.2018.68}, annote = {Keywords: String graph, intersection graph, plane convex set} }
Oliver Roche-Newton. An Improved Bound for the Size of the Set A/A+A. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 69:1-69:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{rochenewton:LIPIcs.SoCG.2018.69, author = {Roche-Newton, Oliver}, title = {{An Improved Bound for the Size of the Set A/A+A}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {69:1--69:12}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.69}, URN = {urn:nbn:de:0030-drops-87820}, doi = {10.4230/LIPIcs.SoCG.2018.69}, annote = {Keywords: sum-product estimates, expanders, incidence theorems, discrete geometry} }
Anastasios Sidiropoulos, Kritika Singhal, and Vijay Sridhar. Fractal Dimension and Lower Bounds for Geometric Problems. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 70:1-70:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{sidiropoulos_et_al:LIPIcs.SoCG.2018.70, author = {Sidiropoulos, Anastasios and Singhal, Kritika and Sridhar, Vijay}, title = {{Fractal Dimension and Lower Bounds for Geometric Problems}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {70:1--70:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.70}, URN = {urn:nbn:de:0030-drops-87831}, doi = {10.4230/LIPIcs.SoCG.2018.70}, annote = {Keywords: fractal dimension, treewidth, spanners, lower bounds, exponential time hypothesis} }
Jonathan Spreer and Stephan Tillmann. The Trisection Genus of Standard Simply Connected PL 4-Manifolds. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 71:1-71:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{spreer_et_al:LIPIcs.SoCG.2018.71, author = {Spreer, Jonathan and Tillmann, Stephan}, title = {{The Trisection Genus of Standard Simply Connected PL 4-Manifolds}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {71:1--71:13}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.71}, URN = {urn:nbn:de:0030-drops-87847}, doi = {10.4230/LIPIcs.SoCG.2018.71}, annote = {Keywords: combinatorial topology, triangulated manifolds, simply connected 4-manifolds, K3 surface, trisections of 4-manifolds} }
Haitao Wang and Jingru Zhang. An O(n log n)-Time Algorithm for the k-Center Problem in Trees. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 72:1-72:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{wang_et_al:LIPIcs.SoCG.2018.72, author = {Wang, Haitao and Zhang, Jingru}, title = {{An O(n log n)-Time Algorithm for the k-Center Problem in Trees}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {72:1--72:15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.72}, URN = {urn:nbn:de:0030-drops-87852}, doi = {10.4230/LIPIcs.SoCG.2018.72}, annote = {Keywords: k-center, trees, facility locations} }
Jie Xue, Yuan Li, Saladi Rahul, and Ravi Janardan. New Bounds for Range Closest-Pair Problems. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 73:1-73:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{xue_et_al:LIPIcs.SoCG.2018.73, author = {Xue, Jie and Li, Yuan and Rahul, Saladi and Janardan, Ravi}, title = {{New Bounds for Range Closest-Pair Problems}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {73:1--73:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.73}, URN = {urn:nbn:de:0030-drops-87865}, doi = {10.4230/LIPIcs.SoCG.2018.73}, annote = {Keywords: Closest-pair, Range search, Candidate pairs, Average-case analysis} }
Aaron T. Becker, Sándor P. Fekete, Phillip Keldenich, Matthias Konitzny, Lillian Lin, and Christian Scheffer. Coordinated Motion Planning: The Video (Multimedia Exposition). In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 74:1-74:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{becker_et_al:LIPIcs.SoCG.2018.74, author = {Becker, Aaron T. and Fekete, S\'{a}ndor P. and Keldenich, Phillip and Konitzny, Matthias and Lin, Lillian and Scheffer, Christian}, title = {{Coordinated Motion Planning: The Video}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {74:1--74:6}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.74}, URN = {urn:nbn:de:0030-drops-87872}, doi = {10.4230/LIPIcs.SoCG.2018.74}, annote = {Keywords: Motion planning, robot swarms, complexity, stretch, approximation} }
Satyan L. Devadoss, Daniel D. Johnson, Justin Lee, and Jackson Warley. Geometric Realizations of the 3D Associahedron (Multimedia Exposition). In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 75:1-75:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{devadoss_et_al:LIPIcs.SoCG.2018.75, author = {Devadoss, Satyan L. and Johnson, Daniel D. and Lee, Justin and Warley, Jackson}, title = {{Geometric Realizations of the 3D Associahedron}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {75:1--75:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.75}, URN = {urn:nbn:de:0030-drops-87886}, doi = {10.4230/LIPIcs.SoCG.2018.75}, annote = {Keywords: associahedron, secondary polytope, realization} }
Dani Demas, Satyan L. Devadoss, and Yu Xuan Hong. Star Unfolding of Boxes (Multimedia Exposition). In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 76:1-76:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{demas_et_al:LIPIcs.SoCG.2018.76, author = {Demas, Dani and Devadoss, Satyan L. and Hong, Yu Xuan}, title = {{Star Unfolding of Boxes}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {76:1--76:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.76}, URN = {urn:nbn:de:0030-drops-87890}, doi = {10.4230/LIPIcs.SoCG.2018.76}, annote = {Keywords: star unfolding, source unfolding, Voronoi diagram} }
Ahmed Abdelkader, Chandrajit L. Bajaj, Mohamed S. Ebeida, Ahmed H. Mahmoud, Scott A. Mitchell, John D. Owens, and Ahmad A. Rushdi. VoroCrust Illustrated: Theory and Challenges (Multimedia Exposition). In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 77:1-77:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{abdelkader_et_al:LIPIcs.SoCG.2018.77, author = {Abdelkader, Ahmed and Bajaj, Chandrajit L. and Ebeida, Mohamed S. and Mahmoud, Ahmed H. and Mitchell, Scott A. and Owens, John D. and Rushdi, Ahmad A.}, title = {{VoroCrust Illustrated: Theory and Challenges}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {77:1--77:4}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.77}, URN = {urn:nbn:de:0030-drops-87903}, doi = {10.4230/LIPIcs.SoCG.2018.77}, annote = {Keywords: sampling, surface reconstruction, polyhedral meshing, Voronoi} }