@Proceedings{cabello_et_al:LIPIcs.SoCG.2020,
title = {{LIPIcs, Volume 164, SoCG 2020, Complete Volume}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {1--1222},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020},
URN = {urn:nbn:de:0030-drops-121576},
doi = {10.4230/LIPIcs.SoCG.2020},
annote = {Keywords: LIPIcs, Volume 164, SoCG 2020, Complete Volume}
}
@InProceedings{cabello_et_al:LIPIcs.SoCG.2020.0,
author = {Cabello, Sergio and Chen, Danny Z.},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {0:i--0:xx},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.0},
URN = {urn:nbn:de:0030-drops-121587},
doi = {10.4230/LIPIcs.SoCG.2020.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
@InProceedings{ackerman_et_al:LIPIcs.SoCG.2020.1,
author = {Ackerman, Eyal and Keszegh, Bal\'{a}zs and Rote, G\"{u}nter},
title = {{An Almost Optimal Bound on the Number of Intersections of Two Simple Polygons}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {1:1--1:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.1},
URN = {urn:nbn:de:0030-drops-121591},
doi = {10.4230/LIPIcs.SoCG.2020.1},
annote = {Keywords: Simple polygon, Ramsey theory, combinatorial geometry}
}
@InProceedings{agarwal_et_al:LIPIcs.SoCG.2020.2,
author = {Agarwal, Pankaj K. and Chang, Hsien-Chih and Suri, Subhash and Xiao, Allen and Xue, Jie},
title = {{Dynamic Geometric Set Cover and Hitting Set}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {2:1--2:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.2},
URN = {urn:nbn:de:0030-drops-121604},
doi = {10.4230/LIPIcs.SoCG.2020.2},
annote = {Keywords: Geometric set cover, Geometric hitting set, Dynamic data structures}
}
@InProceedings{agrawal_et_al:LIPIcs.SoCG.2020.3,
author = {Agrawal, Akanksha and Knudsen, Kristine V. K. and Lokshtanov, Daniel and Saurabh, Saket and Zehavi, Meirav},
title = {{The Parameterized Complexity of Guarding Almost Convex Polygons}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {3:1--3:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.3},
URN = {urn:nbn:de:0030-drops-121614},
doi = {10.4230/LIPIcs.SoCG.2020.3},
annote = {Keywords: Art Gallery, Reflex vertices, Monotone 2-CSP, Parameterized Complexity, Fixed Parameter Tractability}
}
@InProceedings{alkema_et_al:LIPIcs.SoCG.2020.4,
author = {Alkema, Henk and de Berg, Mark and Kisfaludi-Bak, S\'{a}ndor},
title = {{Euclidean TSP in Narrow Strips}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {4:1--4:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.4},
URN = {urn:nbn:de:0030-drops-121628},
doi = {10.4230/LIPIcs.SoCG.2020.4},
annote = {Keywords: Computational geometry, Euclidean TSP, bitonic TSP, fixed-parameter tractable algorithms}
}
@InProceedings{alon_et_al:LIPIcs.SoCG.2020.5,
author = {Alon, Noga and Jartoux, Bruno and Keller, Chaya and Smorodinsky, Shakhar and Yuditsky, Yelena},
title = {{The \epsilon-t-Net Problem}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {5:1--5:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.5},
URN = {urn:nbn:de:0030-drops-121639},
doi = {10.4230/LIPIcs.SoCG.2020.5},
annote = {Keywords: epsilon-nets, geometric hypergraphs, VC-dimension, linear union complexity}
}
@InProceedings{ameer_et_al:LIPIcs.SoCG.2020.6,
author = {Ameer, Safwa and Gibson-Lopez, Matt and Krohn, Erik and Soderman, Sean and Wang, Qing},
title = {{Terrain Visibility Graphs: Persistence Is Not Enough}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {6:1--6:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.6},
URN = {urn:nbn:de:0030-drops-121640},
doi = {10.4230/LIPIcs.SoCG.2020.6},
annote = {Keywords: Terrains, Visibility Graph Characterization, Visibility Graph Recognition}
}
@InProceedings{aronov_et_al:LIPIcs.SoCG.2020.7,
author = {Aronov, Boris and de Berg, Mark and Gudmundsson, Joachim and Horton, Michael},
title = {{On \beta-Plurality Points in Spatial Voting Games}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {7:1--7:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.7},
URN = {urn:nbn:de:0030-drops-121651},
doi = {10.4230/LIPIcs.SoCG.2020.7},
annote = {Keywords: Computational geometry, Spatial voting theory, Plurality point, Computational social choice}
}
@InProceedings{aronov_et_al:LIPIcs.SoCG.2020.8,
author = {Aronov, Boris and Ezra, Esther and Sharir, Micha},
title = {{Testing Polynomials for Vanishing on Cartesian Products of Planar Point Sets}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {8:1--8:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.8},
URN = {urn:nbn:de:0030-drops-121666},
doi = {10.4230/LIPIcs.SoCG.2020.8},
annote = {Keywords: Algebraic decision tree, Polynomial partition, Collinearity testing, 3SUM-hard problems, Polynomials vanishing on Cartesian products}
}
@InProceedings{arroyo_et_al:LIPIcs.SoCG.2020.9,
author = {Arroyo, Alan and Bensmail, Julien and Richter, R. Bruce},
title = {{Extending Drawings of Graphs to Arrangements of Pseudolines}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {9:1--9:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.9},
URN = {urn:nbn:de:0030-drops-121672},
doi = {10.4230/LIPIcs.SoCG.2020.9},
annote = {Keywords: graphs, graph drawings, geometric graph drawings, arrangements of pseudolines, crossing numbers, stretchability}
}
@InProceedings{arya_et_al:LIPIcs.SoCG.2020.10,
author = {Arya, Shreya and Boissonnat, Jean-Daniel and Dutta, Kunal and Lotz, Martin},
title = {{Dimensionality Reduction for k-Distance Applied to Persistent Homology}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {10:1--10:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.10},
URN = {urn:nbn:de:0030-drops-121682},
doi = {10.4230/LIPIcs.SoCG.2020.10},
annote = {Keywords: Dimensionality reduction, Johnson-Lindenstrauss lemma, Topological Data Analysis, Persistent Homology, k-distance, distance to measure}
}
@InProceedings{aukerman_et_al:LIPIcs.SoCG.2020.11,
author = {Aukerman, Andrew and Carri\`{e}re, Mathieu and Chen, Chao and Gardner, Kevin and Rabad\'{a}n, Ra\'{u}l and Vanguri, Rami},
title = {{Persistent Homology Based Characterization of the Breast Cancer Immune Microenvironment: A Feasibility Study}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {11:1--11:20},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.11},
URN = {urn:nbn:de:0030-drops-121695},
doi = {10.4230/LIPIcs.SoCG.2020.11},
annote = {Keywords: Topological data analysis, persistence diagrams}
}
@InProceedings{avvakumov_et_al:LIPIcs.SoCG.2020.12,
author = {Avvakumov, Sergey and Nivasch, Gabriel},
title = {{Homotopic Curve Shortening and the Affine Curve-Shortening Flow}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {12:1--12:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.12},
URN = {urn:nbn:de:0030-drops-121708},
doi = {10.4230/LIPIcs.SoCG.2020.12},
annote = {Keywords: affine curve-shortening flow, shortest homotopic path, integer grid, convex-layer decomposition}
}
@InProceedings{bae_et_al:LIPIcs.SoCG.2020.13,
author = {Bae, Sang Won and Yoon, Sang Duk},
title = {{Empty Squares in Arbitrary Orientation Among Points}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {13:1--13:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.13},
URN = {urn:nbn:de:0030-drops-121716},
doi = {10.4230/LIPIcs.SoCG.2020.13},
annote = {Keywords: empty square, arbitrary orientation, Erd\H{o}s - Szekeres problem, L\underline∞ Voronoi diagram, largest empty square problem, square annulus}
}
@InProceedings{balko_et_al:LIPIcs.SoCG.2020.14,
author = {Balko, Martin and Scheucher, Manfred and Valtr, Pavel},
title = {{Holes and Islands in Random Point Sets}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {14:1--14:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.14},
URN = {urn:nbn:de:0030-drops-121722},
doi = {10.4230/LIPIcs.SoCG.2020.14},
annote = {Keywords: stochastic geometry, random point set, Erd\H{o}s-Szekeres type problem, k-hole, k-island, empty polytope, convex position, Horton set}
}
@InProceedings{bauer_et_al:LIPIcs.SoCG.2020.15,
author = {Bauer, Ulrich and Landi, Claudia and M\'{e}moli, Facundo},
title = {{The Reeb Graph Edit Distance Is Universal}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {15:1--15:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.15},
URN = {urn:nbn:de:0030-drops-121730},
doi = {10.4230/LIPIcs.SoCG.2020.15},
annote = {Keywords: Reeb graphs, topological descriptors, edit distance, interleaving distance}
}
@InProceedings{bekos_et_al:LIPIcs.SoCG.2020.16,
author = {Bekos, Michael A. and Da Lozzo, Giordano and Griesbach, Svenja M. and Gronemann, Martin and Montecchiani, Fabrizio and Raftopoulou, Chrysanthi},
title = {{Book Embeddings of Nonplanar Graphs with Small Faces in Few Pages}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {16:1--16:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.16},
URN = {urn:nbn:de:0030-drops-121749},
doi = {10.4230/LIPIcs.SoCG.2020.16},
annote = {Keywords: Book embeddings, Book thickness, Nonplanar graphs, Planar skeleton}
}
@InProceedings{masood_et_al:LIPIcs.SoCG.2020.17,
author = {Masood, Talha Bin and Ray, Tathagata and Natarajan, Vijay},
title = {{Parallel Computation of Alpha Complexes for Biomolecules}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {17:1--17:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.17},
URN = {urn:nbn:de:0030-drops-121758},
doi = {10.4230/LIPIcs.SoCG.2020.17},
annote = {Keywords: Delaunay triangulation, parallel algorithms, biomolecules, GPU}
}
@InProceedings{blaser_et_al:LIPIcs.SoCG.2020.18,
author = {Blaser, Nello and Brun, Morten},
title = {{Relative Persistent Homology}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {18:1--18:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.18},
URN = {urn:nbn:de:0030-drops-121762},
doi = {10.4230/LIPIcs.SoCG.2020.18},
annote = {Keywords: topological data analysis, relative homology, Delaunay-\v{C}ech complex, alpha complex}
}
@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2020.19,
author = {Boissonnat, Jean-Daniel and Pritam, Siddharth},
title = {{Edge Collapse and Persistence of Flag Complexes}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {19:1--19:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.19},
URN = {urn:nbn:de:0030-drops-121777},
doi = {10.4230/LIPIcs.SoCG.2020.19},
annote = {Keywords: Computational Topology, Topological Data Analysis, Edge Collapse, Simple Collapse, Persistent homology}
}
@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2020.20,
author = {Boissonnat, Jean-Daniel and Wintraecken, Mathijs},
title = {{The Topological Correctness of PL-Approximations of Isomanifolds}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {20:1--20:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.20},
URN = {urn:nbn:de:0030-drops-121787},
doi = {10.4230/LIPIcs.SoCG.2020.20},
annote = {Keywords: PL-approximations, isomanifolds, solution manifolds, topological correctness}
}
@InProceedings{borradaile_et_al:LIPIcs.SoCG.2020.21,
author = {Borradaile, Glencora and Maxwell, William and Nayyeri, Amir},
title = {{Minimum Bounded Chains and Minimum Homologous Chains in Embedded Simplicial Complexes}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.21},
URN = {urn:nbn:de:0030-drops-121799},
doi = {10.4230/LIPIcs.SoCG.2020.21},
annote = {Keywords: computational topology, algorithmic complexity, simplicial complexes}
}
@InProceedings{botnan_et_al:LIPIcs.SoCG.2020.22,
author = {Botnan, Magnus Bakke and Lebovici, Vadim and Oudot, Steve},
title = {{On Rectangle-Decomposable 2-Parameter Persistence Modules}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {22:1--22:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.22},
URN = {urn:nbn:de:0030-drops-121802},
doi = {10.4230/LIPIcs.SoCG.2020.22},
annote = {Keywords: topological data analysis, multiparameter persistence, rank invariant}
}
@InProceedings{brecheteau:LIPIcs.SoCG.2020.23,
author = {Br\'{e}cheteau, Claire},
title = {{Robust Anisotropic Power-Functions-Based Filtrations for Clustering}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {23:1--23:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.23},
URN = {urn:nbn:de:0030-drops-121818},
doi = {10.4230/LIPIcs.SoCG.2020.23},
annote = {Keywords: Power functions, Filtrations, Hierarchical Clustering, Ellipsoids}
}
@InProceedings{buchin_et_al:LIPIcs.SoCG.2020.24,
author = {Buchin, Kevin and Polishchuk, Valentin and Sedov, Leonid and Voronov, Roman},
title = {{Geometric Secluded Paths and Planar Satisfiability}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {24:1--24:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.24},
URN = {urn:nbn:de:0030-drops-121827},
doi = {10.4230/LIPIcs.SoCG.2020.24},
annote = {Keywords: Visibility, Route planning, Security/privacy, Planar satisfiability}
}
@InProceedings{burton:LIPIcs.SoCG.2020.25,
author = {Burton, Benjamin A.},
title = {{The Next 350 Million Knots}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {25:1--25:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.25},
URN = {urn:nbn:de:0030-drops-121831},
doi = {10.4230/LIPIcs.SoCG.2020.25},
annote = {Keywords: Computational topology, knots, 3-manifolds, implementation}
}
@InProceedings{cai_et_al:LIPIcs.SoCG.2020.26,
author = {Cai, Chen and Kim, Woojin and M\'{e}moli, Facundo and Wang, Yusu},
title = {{Elder-Rule-Staircodes for Augmented Metric Spaces}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {26:1--26:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.26},
URN = {urn:nbn:de:0030-drops-121848},
doi = {10.4230/LIPIcs.SoCG.2020.26},
annote = {Keywords: Persistent homology, Multiparameter persistence, Barcodes, Elder rule, Hierarchical clustering, Graded Betti numbers}
}
@InProceedings{chan_et_al:LIPIcs.SoCG.2020.27,
author = {Chan, Timothy M. and He, Qizheng},
title = {{Faster Approximation Algorithms for Geometric Set Cover}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {27:1--27:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.27},
URN = {urn:nbn:de:0030-drops-121856},
doi = {10.4230/LIPIcs.SoCG.2020.27},
annote = {Keywords: Set cover, approximation algorithms, multiplicate weight update method, random sampling, shallow cuttings}
}
@InProceedings{chan_et_al:LIPIcs.SoCG.2020.28,
author = {Chan, Timothy M. and He, Qizheng and Nekrich, Yakov},
title = {{Further Results on Colored Range Searching}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {28:1--28:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.28},
URN = {urn:nbn:de:0030-drops-121868},
doi = {10.4230/LIPIcs.SoCG.2020.28},
annote = {Keywords: Range searching, geometric data structures, randomized incremental construction, random sampling, word RAM}
}
@InProceedings{cheng_et_al:LIPIcs.SoCG.2020.29,
author = {Cheng, Siu-Wing and Chiu, Man-Kwun and Jin, Kai and Wong, Man Ting},
title = {{A Generalization of Self-Improving Algorithms}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {29:1--29:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.29},
URN = {urn:nbn:de:0030-drops-121873},
doi = {10.4230/LIPIcs.SoCG.2020.29},
annote = {Keywords: expected running time, entropy, sorting, Delaunay triangulation}
}
@InProceedings{cheng_et_al:LIPIcs.SoCG.2020.30,
author = {Cheng, Siu-Wing and Lau, Man-Kit},
title = {{Dynamic Distribution-Sensitive Point Location}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {30:1--30:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.30},
URN = {urn:nbn:de:0030-drops-121882},
doi = {10.4230/LIPIcs.SoCG.2020.30},
annote = {Keywords: dynamic planar point location, convex subdivision, linear decision tree}
}
@InProceedings{choudhary_et_al:LIPIcs.SoCG.2020.31,
author = {Choudhary, Aruni and Mulzer, Wolfgang},
title = {{No-Dimensional Tverberg Theorems and Algorithms}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {31:1--31:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.31},
URN = {urn:nbn:de:0030-drops-121893},
doi = {10.4230/LIPIcs.SoCG.2020.31},
annote = {Keywords: Tverberg’s theorem, Colorful Carath\'{e}odory Theorem, Tensor lifting}
}
@InProceedings{cohensteiner_et_al:LIPIcs.SoCG.2020.32,
author = {Cohen-Steiner, David and Lieutier, Andr\'{e} and Vuillamy, Julien},
title = {{Lexicographic Optimal Homologous Chains and Applications to Point Cloud Triangulations}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {32:1--32:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.32},
URN = {urn:nbn:de:0030-drops-121908},
doi = {10.4230/LIPIcs.SoCG.2020.32},
annote = {Keywords: OHCP, simplicial homology, triangulation, Delaunay}
}
@InProceedings{demaine_et_al:LIPIcs.SoCG.2020.33,
author = {Demaine, Erik D. and Hesterberg, Adam C. and Ku, Jason S.},
title = {{Finding Closed Quasigeodesics on Convex Polyhedra}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {33:1--33:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.33},
URN = {urn:nbn:de:0030-drops-121912},
doi = {10.4230/LIPIcs.SoCG.2020.33},
annote = {Keywords: polyhedra, geodesic, pseudopolynomial, geometric precision}
}
@InProceedings{dennis_et_al:LIPIcs.SoCG.2020.34,
author = {Dennis, Michael and Perkovi\'{c}, Ljubomir and T\"{u}rko\u{g}lu, Duru},
title = {{The Stretch Factor of Hexagon-Delaunay Triangulations}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {34:1--34:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.34},
URN = {urn:nbn:de:0030-drops-121920},
doi = {10.4230/LIPIcs.SoCG.2020.34},
annote = {Keywords: Delaunay triangulation, geometric spanner, plane spanner, stretch factor, spanning ratio}
}
@InProceedings{despre_et_al:LIPIcs.SoCG.2020.35,
author = {Despr\'{e}, Vincent and Schlenker, Jean-Marc and Teillaud, Monique},
title = {{Flipping Geometric Triangulations on Hyperbolic Surfaces}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {35:1--35:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.35},
URN = {urn:nbn:de:0030-drops-121939},
doi = {10.4230/LIPIcs.SoCG.2020.35},
annote = {Keywords: Hyperbolic surface, Topology, Delaunay triangulation, Algorithm, Flip graph}
}
@InProceedings{dey_et_al:LIPIcs.SoCG.2020.36,
author = {Dey, Tamal K. and Li, Tianqi and Wang, Yusu},
title = {{An Efficient Algorithm for 1-Dimensional (Persistent) Path Homology}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {36:1--36:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.36},
URN = {urn:nbn:de:0030-drops-121944},
doi = {10.4230/LIPIcs.SoCG.2020.36},
annote = {Keywords: computational topology, directed graph, path homology, persistent path homology}
}
@InProceedings{dey_et_al:LIPIcs.SoCG.2020.37,
author = {Dey, Tamal K. and Mrozek, Marian and Slechta, Ryan},
title = {{Persistence of the Conley Index in Combinatorial Dynamical Systems}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {37:1--37:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.37},
URN = {urn:nbn:de:0030-drops-121958},
doi = {10.4230/LIPIcs.SoCG.2020.37},
annote = {Keywords: Dynamical systems, combinatorial vector field, multivector, Conley index, persistence}
}
@InProceedings{eder_et_al:LIPIcs.SoCG.2020.38,
author = {Eder, G\"{u}nther and Held, Martin and Palfrader, Peter},
title = {{On Implementing Straight Skeletons: Challenges and Experiences}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {38:1--38:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.38},
URN = {urn:nbn:de:0030-drops-121964},
doi = {10.4230/LIPIcs.SoCG.2020.38},
annote = {Keywords: weighted straight skeleton, implementation, algorithm engineering, experiments, Cgal, Core}
}
@InProceedings{eiben_et_al:LIPIcs.SoCG.2020.39,
author = {Eiben, Eduard and Lokshtanov, Daniel},
title = {{Removing Connected Obstacles in the Plane Is FPT}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {39:1--39:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.39},
URN = {urn:nbn:de:0030-drops-121972},
doi = {10.4230/LIPIcs.SoCG.2020.39},
annote = {Keywords: parameterized complexity and algorithms, planar graphs, motion planning, barrier coverage, barrier resilience, colored path, minimum constraint removal}
}
@InProceedings{erickson_et_al:LIPIcs.SoCG.2020.40,
author = {Erickson, Jeff and Lin, Patrick},
title = {{A Toroidal Maxwell-Cremona-Delaunay Correspondence}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {40:1--40:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.40},
URN = {urn:nbn:de:0030-drops-121984},
doi = {10.4230/LIPIcs.SoCG.2020.40},
annote = {Keywords: combinatorial topology, geometric graphs, homology, flat torus, spring embedding, intrinsic Delaunay}
}
@InProceedings{evans_et_al:LIPIcs.SoCG.2020.41,
author = {Evans, Parker and Fasy, Brittany Terese and Wenk, Carola},
title = {{Combinatorial Properties of Self-Overlapping Curves and Interior Boundaries}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {41:1--41:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.41},
URN = {urn:nbn:de:0030-drops-121993},
doi = {10.4230/LIPIcs.SoCG.2020.41},
annote = {Keywords: Self-overlapping curves, interior boundaries, minimum homotopy area, immersion}
}
@InProceedings{fekete_et_al:LIPIcs.SoCG.2020.42,
author = {Fekete, S\'{a}ndor P. and Gupta, Utkarsh and Keldenich, Phillip and Scheffer, Christian and Shah, Sahil},
title = {{Worst-Case Optimal Covering of Rectangles by Disks}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {42:1--42:23},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.42},
URN = {urn:nbn:de:0030-drops-122003},
doi = {10.4230/LIPIcs.SoCG.2020.42},
annote = {Keywords: Disk covering, critical density, covering coefficient, tight worst-case bound, interval arithmetic, approximation}
}
@InProceedings{fekete_et_al:LIPIcs.SoCG.2020.43,
author = {Fekete, S\'{a}ndor P. and Kleist, Linda and Krupke, Dominik},
title = {{Minimum Scan Cover with Angular Transition Costs}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {43:1--43:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.43},
URN = {urn:nbn:de:0030-drops-122014},
doi = {10.4230/LIPIcs.SoCG.2020.43},
annote = {Keywords: Graph scanning, graph coloring, angular metric, complexity, approximation, scheduling}
}
@InProceedings{fomin_et_al:LIPIcs.SoCG.2020.44,
author = {Fomin, Fedor V. and Lokshtanov, Daniel and Panolan, Fahad and Saurabh, Saket and Zehavi, Meirav},
title = {{ETH-Tight Algorithms for Long Path and Cycle on Unit Disk Graphs}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {44:1--44:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.44},
URN = {urn:nbn:de:0030-drops-122024},
doi = {10.4230/LIPIcs.SoCG.2020.44},
annote = {Keywords: Optimality Program, ETH, Unit Disk Graphs, Parameterized Complexity, Long Path, Long Cycle}
}
@InProceedings{fox_et_al:LIPIcs.SoCG.2020.45,
author = {Fox, Kyle and Lu, Jiashuai},
title = {{A Near-Linear Time Approximation Scheme for Geometric Transportation with Arbitrary Supplies and Spread}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {45:1--45:18},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.45},
URN = {urn:nbn:de:0030-drops-122034},
doi = {10.4230/LIPIcs.SoCG.2020.45},
annote = {Keywords: Transportation map, earth mover’s distance, shape matching, approximation algorithms}
}
@InProceedings{fox_et_al:LIPIcs.SoCG.2020.46,
author = {Fox, Jacob and Pach, J\'{a}nos and Suk, Andrew},
title = {{Bounded VC-Dimension Implies the Schur-Erd\H{o}s Conjecture}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {46:1--46:8},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.46},
URN = {urn:nbn:de:0030-drops-122046},
doi = {10.4230/LIPIcs.SoCG.2020.46},
annote = {Keywords: Ramsey theory, VC-dimension, Multicolor Ramsey numbers}
}
@InProceedings{frankl_et_al:LIPIcs.SoCG.2020.47,
author = {Frankl, N\'{o}ra and Hubai, Tam\'{a}s and P\'{a}lv\"{o}lgyi, D\"{o}m\"{o}t\"{o}r},
title = {{Almost-Monochromatic Sets and the Chromatic Number of the Plane}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {47:1--47:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.47},
URN = {urn:nbn:de:0030-drops-122054},
doi = {10.4230/LIPIcs.SoCG.2020.47},
annote = {Keywords: discrete geometry, Hadwiger-Nelson problem, Euclidean Ramsey theory}
}
@InProceedings{frankl_et_al:LIPIcs.SoCG.2020.48,
author = {Frankl, N\'{o}ra and Kupavskii, Andrey},
title = {{Almost Sharp Bounds on the Number of Discrete Chains in the Plane}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {48:1--48:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.48},
URN = {urn:nbn:de:0030-drops-122064},
doi = {10.4230/LIPIcs.SoCG.2020.48},
annote = {Keywords: unit distance problem, unit distance graphs, discrete chains}
}
@InProceedings{goaoc_et_al:LIPIcs.SoCG.2020.49,
author = {Goaoc, Xavier and Welzl, Emo},
title = {{Convex Hulls of Random Order Types}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {49:1--49:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.49},
URN = {urn:nbn:de:0030-drops-122074},
doi = {10.4230/LIPIcs.SoCG.2020.49},
annote = {Keywords: order type, oriented matroid, Sylvester’s Four-Point Problem, random convex hull, projective plane, excluded pattern, Hadwiger’s transversal theorem, hairy ball theorem}
}
@InProceedings{harpeled_et_al:LIPIcs.SoCG.2020.50,
author = {Har-Peled, Sariel and Jones, Mitchell},
title = {{Fast Algorithms for Geometric Consensuses}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {50:1--50:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.50},
URN = {urn:nbn:de:0030-drops-122088},
doi = {10.4230/LIPIcs.SoCG.2020.50},
annote = {Keywords: Geometric optimization, centerpoint, voting games}
}
@InProceedings{henzinger_et_al:LIPIcs.SoCG.2020.51,
author = {Henzinger, Monika and Neumann, Stefan and Wiese, Andreas},
title = {{Dynamic Approximate Maximum Independent Set of Intervals, Hypercubes and Hyperrectangles}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {51:1--51:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.51},
URN = {urn:nbn:de:0030-drops-122094},
doi = {10.4230/LIPIcs.SoCG.2020.51},
annote = {Keywords: Dynamic algorithms, independent set, approximation algorithms, interval graphs, geometric intersection graphs}
}
@InProceedings{kaplan_et_al:LIPIcs.SoCG.2020.52,
author = {Kaplan, Haim and Sharir, Micha and Stemmer, Uri},
title = {{How to Find a Point in the Convex Hull Privately}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {52:1--52:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.52},
URN = {urn:nbn:de:0030-drops-122107},
doi = {10.4230/LIPIcs.SoCG.2020.52},
annote = {Keywords: Differential privacy, Tukey depth, Convex hull}
}
@InProceedings{kerber_et_al:LIPIcs.SoCG.2020.53,
author = {Kerber, Michael and Nigmetov, Arnur},
title = {{Efficient Approximation of the Matching Distance for 2-Parameter Persistence}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {53:1--53:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.53},
URN = {urn:nbn:de:0030-drops-122116},
doi = {10.4230/LIPIcs.SoCG.2020.53},
annote = {Keywords: multi-parameter persistence, matching distance, approximation algorithm}
}
@InProceedings{kim_et_al:LIPIcs.SoCG.2020.54,
author = {Kim, Jisu and Shin, Jaehyeok and Chazal, Fr\'{e}d\'{e}ric and Rinaldo, Alessandro and Wasserman, Larry},
title = {{Homotopy Reconstruction via the Cech Complex and the Vietoris-Rips Complex}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {54:1--54:19},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.54},
URN = {urn:nbn:de:0030-drops-122129},
doi = {10.4230/LIPIcs.SoCG.2020.54},
annote = {Keywords: Computational topology, Homotopy reconstruction, Homotopy Equivalence, Vietoris-Rips complex, \v{C}ech complex, Reach, \mu-reach, Nerve Theorem, Offset, Double offset, Consistency}
}
@InProceedings{kisfaludibak:LIPIcs.SoCG.2020.55,
author = {Kisfaludi-Bak, S\'{a}ndor},
title = {{A Quasi-Polynomial Algorithm for Well-Spaced Hyperbolic TSP}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {55:1--55:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.55},
URN = {urn:nbn:de:0030-drops-122135},
doi = {10.4230/LIPIcs.SoCG.2020.55},
annote = {Keywords: Computational geometry, Hyperbolic geometry, Traveling salesman}
}
@InProceedings{maria_et_al:LIPIcs.SoCG.2020.56,
author = {Maria, Cl\'{e}ment and Oudot, Steve and Solomon, Elchanan},
title = {{Intrinsic Topological Transforms via the Distance Kernel Embedding}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {56:1--56:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.56},
URN = {urn:nbn:de:0030-drops-122145},
doi = {10.4230/LIPIcs.SoCG.2020.56},
annote = {Keywords: Topological Transforms, Persistent Homology, Inverse Problems, Spectral Geometry, Algebraic Topology, Topological Data Analysis}
}
@InProceedings{mulzer_et_al:LIPIcs.SoCG.2020.57,
author = {Mulzer, Wolfgang and Valtr, Pavel},
title = {{Long Alternating Paths Exist}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {57:1--57:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.57},
URN = {urn:nbn:de:0030-drops-122152},
doi = {10.4230/LIPIcs.SoCG.2020.57},
annote = {Keywords: Non-crossing path, bichromatic point sets}
}
@InProceedings{nath_et_al:LIPIcs.SoCG.2020.58,
author = {Nath, Abhinandan and Taylor, Erin},
title = {{k-Median Clustering Under Discrete Fr\'{e}chet and Hausdorff Distances}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {58:1--58:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.58},
URN = {urn:nbn:de:0030-drops-122161},
doi = {10.4230/LIPIcs.SoCG.2020.58},
annote = {Keywords: Clustering, k-median, trajectories, point sets, discrete Fr\'{e}chet distance, Hausdorff distance}
}
@InProceedings{nekrich:LIPIcs.SoCG.2020.59,
author = {Nekrich, Yakov},
title = {{Four-Dimensional Dominance Range Reporting in Linear Space}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {59:1--59:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.59},
URN = {urn:nbn:de:0030-drops-122170},
doi = {10.4230/LIPIcs.SoCG.2020.59},
annote = {Keywords: Range searching, geometric data structures, word RAM}
}
@InProceedings{palvolgyi:LIPIcs.SoCG.2020.60,
author = {P\'{a}lv\"{o}lgyi, D\"{o}m\"{o}t\"{o}r},
title = {{Radon Numbers Grow Linearly}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {60:1--60:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.60},
URN = {urn:nbn:de:0030-drops-122183},
doi = {10.4230/LIPIcs.SoCG.2020.60},
annote = {Keywords: discrete geometry, convexity space, Radon number}
}
@InProceedings{patakova:LIPIcs.SoCG.2020.61,
author = {Pat\'{a}kov\'{a}, Zuzana},
title = {{Bounding Radon Number via Betti Numbers}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {61:1--61:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.61},
URN = {urn:nbn:de:0030-drops-122198},
doi = {10.4230/LIPIcs.SoCG.2020.61},
annote = {Keywords: Radon number, topological complexity, constrained chain maps, fractional Helly theorem, convexity spaces}
}
@InProceedings{patakova_et_al:LIPIcs.SoCG.2020.62,
author = {Pat\'{a}kov\'{a}, Zuzana and Tancer, Martin and Wagner, Uli},
title = {{Barycentric Cuts Through a Convex Body}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {62:1--62:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.62},
URN = {urn:nbn:de:0030-drops-122201},
doi = {10.4230/LIPIcs.SoCG.2020.62},
annote = {Keywords: convex body, barycenter, Tukey depth, smooth manifold, critical points}
}
@InProceedings{phillips_et_al:LIPIcs.SoCG.2020.63,
author = {Phillips, Jeff M. and Tang, Pingfan},
title = {{Sketched MinDist}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {63:1--63:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.63},
URN = {urn:nbn:de:0030-drops-122218},
doi = {10.4230/LIPIcs.SoCG.2020.63},
annote = {Keywords: curve similarity, sensitivity sampling, sketching}
}
@InProceedings{rathod:LIPIcs.SoCG.2020.64,
author = {Rathod, Abhishek},
title = {{Fast Algorithms for Minimum Cycle Basis and Minimum Homology Basis}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {64:1--64:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.64},
URN = {urn:nbn:de:0030-drops-122223},
doi = {10.4230/LIPIcs.SoCG.2020.64},
annote = {Keywords: Computational topology, Minimum homology basis, Minimum cycle basis, Simplicial complexes, Matrix computations}
}
@InProceedings{raz_et_al:LIPIcs.SoCG.2020.65,
author = {Raz, Orit E. and Solymosi, J\'{o}zsef},
title = {{Dense Graphs Have Rigid Parts}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {65:1--65:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.65},
URN = {urn:nbn:de:0030-drops-122236},
doi = {10.4230/LIPIcs.SoCG.2020.65},
annote = {Keywords: Graph rigidity, line configurations in 3D}
}
@InProceedings{sharir_et_al:LIPIcs.SoCG.2020.66,
author = {Sharir, Micha and Zlydenko, Oleg},
title = {{Incidences Between Points and Curves with Almost Two Degrees of Freedom}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {66:1--66:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.66},
URN = {urn:nbn:de:0030-drops-122244},
doi = {10.4230/LIPIcs.SoCG.2020.66},
annote = {Keywords: Incidences, Polynomial partition, Degrees of freedom, Infinitely-ruled surfaces, Three dimensions}
}
@InProceedings{wagner_et_al:LIPIcs.SoCG.2020.67,
author = {Wagner, Uli and Welzl, Emo},
title = {{Connectivity of Triangulation Flip Graphs in the Plane (Part II: Bistellar Flips)}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {67:1--67:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.67},
URN = {urn:nbn:de:0030-drops-122259},
doi = {10.4230/LIPIcs.SoCG.2020.67},
annote = {Keywords: triangulation, flip graph, graph connectivity, associahedron, subdivision, convex decomposition, flippable edge, flip complex, regular triangulation, bistellar flip graph, secondary polytope, polyhedral subdivision}
}
@InProceedings{wang:LIPIcs.SoCG.2020.68,
author = {Wang, Haitao},
title = {{On the Planar Two-Center Problem and Circular Hulls}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {68:1--68:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.68},
URN = {urn:nbn:de:0030-drops-122267},
doi = {10.4230/LIPIcs.SoCG.2020.68},
annote = {Keywords: two-center, disk coverage, circular hulls, dynamic data structures}
}
@InProceedings{wang:LIPIcs.SoCG.2020.69,
author = {Wang, Haitao},
title = {{Algorithms for Subpath Convex Hull Queries and Ray-Shooting Among Segments}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {69:1--69:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.69},
URN = {urn:nbn:de:0030-drops-122275},
doi = {10.4230/LIPIcs.SoCG.2020.69},
annote = {Keywords: subpath hull queries, convex hulls, compact interval trees, ray-shooting, data structures}
}
@InProceedings{zhang_et_al:LIPIcs.SoCG.2020.70,
author = {Zhang, Simon and Xiao, Mengbai and Wang, Hao},
title = {{GPU-Accelerated Computation of Vietoris-Rips Persistence Barcodes}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {70:1--70:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.70},
URN = {urn:nbn:de:0030-drops-122287},
doi = {10.4230/LIPIcs.SoCG.2020.70},
annote = {Keywords: Parallel Algorithms, Topological Data Analysis, Vietoris-Rips, Persistent Homology, Apparent Pairs, High Performance Computing, GPU, Random Graphs}
}
@InProceedings{vandommelen_et_al:LIPIcs.SoCG.2020.71,
author = {van Dommelen, Casper and van Kreveld, Marc and Urhausen, J\'{e}r\^{o}me},
title = {{The Spiroplot App}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {71:1--71:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.71},
URN = {urn:nbn:de:0030-drops-122292},
doi = {10.4230/LIPIcs.SoCG.2020.71},
annote = {Keywords: generative art, dynamic system, pattern generation tool}
}
@InProceedings{baez_et_al:LIPIcs.SoCG.2020.72,
author = {Baez, Victor M. and Becker, Aaron T. and Fekete, S\'{a}ndor P. and Schmidt, Arne},
title = {{Coordinated Particle Relocation with Global Signals and Local Friction}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {72:1--72:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.72},
URN = {urn:nbn:de:0030-drops-122305},
doi = {10.4230/LIPIcs.SoCG.2020.72},
annote = {Keywords: Global control, reconfiguration, geometric algorithms, friction}
}
@InProceedings{abdelrahman_et_al:LIPIcs.SoCG.2020.73,
author = {Abdel-Rahman, Amira and Becker, Aaron T. and Biediger, Daniel E. and Cheung, Kenneth C. and Fekete, S\'{a}ndor P. and Gershenfeld, Neil A. and Hugo, Sabrina and Jenett, Benjamin and Keldenich, Phillip and Niehs, Eike and Rieck, Christian and Schmidt, Arne and Scheffer, Christian and Yannuzzi, Michael},
title = {{Space Ants: Constructing and Reconfiguring Large-Scale Structures with Finite Automata}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {73:1--73:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.73},
URN = {urn:nbn:de:0030-drops-122310},
doi = {10.4230/LIPIcs.SoCG.2020.73},
annote = {Keywords: Finite automata, reconfiguration, construction, scaling}
}
@InProceedings{becker_et_al:LIPIcs.SoCG.2020.74,
author = {Becker, Aaron T. and Fekete, S\'{a}ndor P.},
title = {{How to Make a CG Video}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {74:1--74:6},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.74},
URN = {urn:nbn:de:0030-drops-122328},
doi = {10.4230/LIPIcs.SoCG.2020.74},
annote = {Keywords: Videos, animation, education, SoCG Multimedia}
}
@InProceedings{fekete_et_al:LIPIcs.SoCG.2020.75,
author = {Fekete, S\'{a}ndor P. and Keldenich, Phillip and Scheffer, Christian},
title = {{Covering Rectangles by Disks: The Video}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {75:1--75:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.75},
URN = {urn:nbn:de:0030-drops-122337},
doi = {10.4230/LIPIcs.SoCG.2020.75},
annote = {Keywords: Disk covering, critical density, covering coefficient, tight worst-case bound, interval arithmetic, approximation}
}
@InProceedings{eder_et_al:LIPIcs.SoCG.2020.76,
author = {Eder, G\"{u}nther and Held, Martin and Palfrader, Peter},
title = {{Step-By-Step Straight Skeletons}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {76:1--76:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.76},
URN = {urn:nbn:de:0030-drops-122343},
doi = {10.4230/LIPIcs.SoCG.2020.76},
annote = {Keywords: weighted straight skeleton, implementation, visualization, graphical user interface, education}
}
@InProceedings{dewar_et_al:LIPIcs.SoCG.2020.77,
author = {Dewar, Sean and Grasegger, Georg and Legersk\'{y}, Jan},
title = {{Computing Animations of Linkages with Rotational Symmetry}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {77:1--77:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.77},
URN = {urn:nbn:de:0030-drops-122356},
doi = {10.4230/LIPIcs.SoCG.2020.77},
annote = {Keywords: Flexibility, Linkages, Symmetry}
}
@InProceedings{miltzow_et_al:LIPIcs.SoCG.2020.78,
author = {Miltzow, Tillmann and Parada, Irene and Sonke, Willem and Speckmann, Bettina and Wulms, Jules},
title = {{Hiding Sliding Cubes: Why Reconfiguring Modular Robots Is Not Easy}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {78:1--78:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.78},
URN = {urn:nbn:de:0030-drops-122363},
doi = {10.4230/LIPIcs.SoCG.2020.78},
annote = {Keywords: Sliding cubes, Reconfiguration, Modular robots}
}
@InProceedings{buchin_et_al:LIPIcs.SoCG.2020.79,
author = {Buchin, Kevin and Hagedoorn, Mart and Kostitsyna, Irina and van Mulken, Max and Rensen, Jolan and van Schooten, Leo},
title = {{Dots \& Polygons}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {79:1--79:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.79},
URN = {urn:nbn:de:0030-drops-122371},
doi = {10.4230/LIPIcs.SoCG.2020.79},
annote = {Keywords: Dots \& Boxes, NP-hard, game, cycle packing}
}
@InProceedings{vanbenthem_et_al:LIPIcs.SoCG.2020.80,
author = {van Benthem, Toon and Buchin, Kevin and Kostitsyna, Irina and Slot, Stijn},
title = {{Designing Art Galleries}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {80:1--80:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.80},
URN = {urn:nbn:de:0030-drops-122382},
doi = {10.4230/LIPIcs.SoCG.2020.80},
annote = {Keywords: Art Gallery problem, NP-hard, puzzle, level generation}
}
@InProceedings{haverkort:LIPIcs.SoCG.2020.81,
author = {Haverkort, Herman},
title = {{Plane-Filling Trails}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {81:1--81:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.81},
URN = {urn:nbn:de:0030-drops-122396},
doi = {10.4230/LIPIcs.SoCG.2020.81},
annote = {Keywords: space-filling curve, plane-filling curve, spatial indexing}
}
@InProceedings{zhou_et_al:LIPIcs.SoCG.2020.82,
author = {Zhou, Youjia and Knudson, Kevin and Wang, Bei},
title = {{Visual Demo of Discrete Stratified Morse Theory}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {82:1--82:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.82},
URN = {urn:nbn:de:0030-drops-122409},
doi = {10.4230/LIPIcs.SoCG.2020.82},
annote = {Keywords: Discrete Morse theory, stratified Morse theory, discrete stratified Morse theory, topological data analysis, data visualization}
}
@InProceedings{zheng_et_al:LIPIcs.SoCG.2020.83,
author = {Zheng, Da Wei and Spalding-Jamieson, Jack and Zhang, Brandon},
title = {{Computing Low-Cost Convex Partitions for Planar Point Sets with Randomized Local Search and Constraint Programming}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {83:1--83:7},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.83},
URN = {urn:nbn:de:0030-drops-122412},
doi = {10.4230/LIPIcs.SoCG.2020.83},
annote = {Keywords: convex partition, randomized local search, planar point sets}
}
@InProceedings{moalic_et_al:LIPIcs.SoCG.2020.84,
author = {Moalic, Laurent and Schmitt, Dominique and Lepagnot, Julien and Kritter, Julien},
title = {{Computing Low-Cost Convex Partitions for Planar Point Sets Based on a Memetic Approach}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {84:1--84:9},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.84},
URN = {urn:nbn:de:0030-drops-122423},
doi = {10.4230/LIPIcs.SoCG.2020.84},
annote = {Keywords: metaheuristics, memetic algorithms, convex partition optimization}
}
@InProceedings{eder_et_al:LIPIcs.SoCG.2020.85,
author = {Eder, G\"{u}nther and Held, Martin and de Lorenzo, Stefan and Palfrader, Peter},
title = {{Computing Low-Cost Convex Partitions for Planar Point Sets Based on Tailored Decompositions}},
booktitle = {36th International Symposium on Computational Geometry (SoCG 2020)},
pages = {85:1--85:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-143-6},
ISSN = {1868-8969},
year = {2020},
volume = {164},
editor = {Cabello, Sergio and Chen, Danny Z.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2020.85},
URN = {urn:nbn:de:0030-drops-122438},
doi = {10.4230/LIPIcs.SoCG.2020.85},
annote = {Keywords: Computational Geometry, geometric optimization, algorithm engineering, convex decomposition}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing