@Proceedings{fekete_et_al:LIPIcs.SoCG.2016,
title = {{LIPIcs, Volume 51, SoCG'16, Complete Volume}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016},
URN = {urn:nbn:de:0030-drops-60580},
doi = {10.4230/LIPIcs.SoCG.2016},
annote = {Keywords: Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Geometrical problems and computations, Discrete Mathematics, Combinatorics, Computer Graphics, Computational Geometry and Object Modeling}
}
@InProceedings{fekete_et_al:LIPIcs.SoCG.2016.0,
author = {Fekete, S\'{a}ndor and Lubiw, Anna},
title = {{Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {0:i--0:xviii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.0},
URN = {urn:nbn:de:0030-drops-59658},
doi = {10.4230/LIPIcs.SoCG.2016.0},
annote = {Keywords: Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors}
}
@InProceedings{rus:LIPIcs.SoCG.2016.1,
author = {Rus, Daniela},
title = {{Toward Pervasive Robots}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.1},
URN = {urn:nbn:de:0030-drops-58939},
doi = {10.4230/LIPIcs.SoCG.2016.1},
annote = {Keywords: rus@csail.mit.edu}
}
@InProceedings{fox:LIPIcs.SoCG.2016.2,
author = {Fox, Jacob},
title = {{Discrete Geometry, Algebra, and Combinatorics}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.2},
URN = {urn:nbn:de:0030-drops-58948},
doi = {10.4230/LIPIcs.SoCG.2016.2},
annote = {Keywords: discrete geometry, extremal combinatorics, regularity lemmas, Ramsey theory}
}
@InProceedings{abel_et_al:LIPIcs.SoCG.2016.3,
author = {Abel, Zachary and Demaine, Erik D. and Demaine, Martin L. and Eisenstat, Sarah and Lynch, Jayson and Schardl, Tao B.},
title = {{Who Needs Crossings? Hardness of Plane Graph Rigidity}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.3},
URN = {urn:nbn:de:0030-drops-58951},
doi = {10.4230/LIPIcs.SoCG.2016.3},
annote = {Keywords: Graph Drawing, Graph Rigidity Theory, Graph Global Rigidity, Linkages, Complexity Theory, Computational Geometry}
}
@InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2016.4,
author = {Abrahamsen, Mikkel and Thorup, Mikkel},
title = {{Finding the Maximum Subset with Bounded Convex Curvature}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {4:1--4:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.4},
URN = {urn:nbn:de:0030-drops-58960},
doi = {10.4230/LIPIcs.SoCG.2016.4},
annote = {Keywords: planar computational geometry, bounded curvature, pocket machining}
}
@InProceedings{ackerman_et_al:LIPIcs.SoCG.2016.5,
author = {Ackerman, Eyal and Keszegh, Bal\'{a}zs and Vizer, M\'{a}t\'{e}},
title = {{Coloring Points with Respect to Squares}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {5:1--5:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.5},
URN = {urn:nbn:de:0030-drops-58972},
doi = {10.4230/LIPIcs.SoCG.2016.5},
annote = {Keywords: Geometric hypergraph coloring, Polychromatic coloring, Homothets, Cover-decomposability}
}
@InProceedings{agarwal_et_al:LIPIcs.SoCG.2016.6,
author = {Agarwal, Pankaj K. and Fox, Kyle and Pan, Jiangwei and Ying, Rex},
title = {{Approximating Dynamic Time Warping and Edit Distance for a Pair of Point Sequences}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {6:1--6:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.6},
URN = {urn:nbn:de:0030-drops-58989},
doi = {10.4230/LIPIcs.SoCG.2016.6},
annote = {Keywords: Dynamic time warping, Edit distance, Near-linear-time algorithm, Dynamic programming, Well-separated pair decomposition}
}
@InProceedings{aichholzer_et_al:LIPIcs.SoCG.2016.7,
author = {Aichholzer, Oswin and Alvarez, Victor and Hackl, Thomas and Pilz, Alexander and Speckmann, Bettina and Vogtenhuber, Birgit},
title = {{An Improved Lower Bound on the Minimum Number of Triangulations}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {7:1--7:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.7},
URN = {urn:nbn:de:0030-drops-58993},
doi = {10.4230/LIPIcs.SoCG.2016.7},
annote = {Keywords: Combinatorial geometry, Order types, Triangulations}
}
@InProceedings{akitaya_et_al:LIPIcs.SoCG.2016.8,
author = {Akitaya, Hugo A. and Aloupis, Greg and Erickson, Jeff and T\'{o}th, Csaba},
title = {{Recognizing Weakly Simple Polygons}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {8:1--8:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.8},
URN = {urn:nbn:de:0030-drops-59003},
doi = {10.4230/LIPIcs.SoCG.2016.8},
annote = {Keywords: weakly simple polygon, crossing}
}
@InProceedings{andoni_et_al:LIPIcs.SoCG.2016.9,
author = {Andoni, Alexandr and Razensteyn, Ilya},
title = {{Tight Lower Bounds for Data-Dependent Locality-Sensitive Hashing}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {9:1--9:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.9},
URN = {urn:nbn:de:0030-drops-59014},
doi = {10.4230/LIPIcs.SoCG.2016.9},
annote = {Keywords: similarity search, high-dimensional geometry, LSH, data structures, lower bounds}
}
@InProceedings{aronov_et_al:LIPIcs.SoCG.2016.10,
author = {Aronov, Boris and Cheong, Otfried and Dobbins, Michael Gene and Goaoc, Xavier},
title = {{The Number of Holes in the Union of Translates of a Convex Set in Three Dimensions}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {10:1--10:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.10},
URN = {urn:nbn:de:0030-drops-59024},
doi = {10.4230/LIPIcs.SoCG.2016.10},
annote = {Keywords: Union complexity, Convex sets, Motion planning}
}
@InProceedings{arya_et_al:LIPIcs.SoCG.2016.11,
author = {Arya, Sunil and da Fonseca, Guilherme D. and Mount, David M.},
title = {{On the Combinatorial Complexity of Approximating Polytopes}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.11},
URN = {urn:nbn:de:0030-drops-59034},
doi = {10.4230/LIPIcs.SoCG.2016.11},
annote = {Keywords: Polytope approximation, Convex polytopes, Macbeath regions}
}
@InProceedings{bagchi_et_al:LIPIcs.SoCG.2016.12,
author = {Bagchi, Bhaskar and Datta, Basudeb and Burton, Benjamin A. and Singh, Nitin and Spreer, Jonathan},
title = {{Efficient Algorithms to Decide Tightness}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {12:1--12:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.12},
URN = {urn:nbn:de:0030-drops-59040},
doi = {10.4230/LIPIcs.SoCG.2016.12},
annote = {Keywords: discrete geometry and topology, polynomial time algorithms, fixed parameter tractability, tight triangulations, simplicial complexes}
}
@InProceedings{balas_et_al:LIPIcs.SoCG.2016.13,
author = {Balas, Kevin and Dumitrescu, Adrian and T\'{o}th, Csaba},
title = {{Anchored Rectangle and Square Packings}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {13:1--13:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.13},
URN = {urn:nbn:de:0030-drops-59054},
doi = {10.4230/LIPIcs.SoCG.2016.13},
annote = {Keywords: Rectangle packing, anchored rectangle, greedy algorithm, charging scheme, approximation algorithm.}
}
@InProceedings{bandyapadhyay_et_al:LIPIcs.SoCG.2016.14,
author = {Bandyapadhyay, Sayan and Varadarajan, Kasturi},
title = {{On Variants of k-means Clustering}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {14:1--14:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.14},
URN = {urn:nbn:de:0030-drops-59061},
doi = {10.4230/LIPIcs.SoCG.2016.14},
annote = {Keywords: k-means, Facility location, Local search, Geometric approximation}
}
@InProceedings{allen_et_al:LIPIcs.SoCG.2016.15,
author = {Allen, Sarah R. and Barba, Luis and Iacono, John and Langerman, Stefan},
title = {{Incremental Voronoi diagrams}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {15:1--15:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.15},
URN = {urn:nbn:de:0030-drops-59079},
doi = {10.4230/LIPIcs.SoCG.2016.15},
annote = {Keywords: Voronoi diagrams, dynamic data structures, Delaunay triangulation}
}
@InProceedings{bartal_et_al:LIPIcs.SoCG.2016.16,
author = {Bartal, Yair and Gottlieb, Lee-Ad},
title = {{Dimension Reduction Techniques for l\underlinep (1\langlep\langle2), with Applications}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {16:1--16:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.16},
URN = {urn:nbn:de:0030-drops-59081},
doi = {10.4230/LIPIcs.SoCG.2016.16},
annote = {Keywords: Dimension reduction, embeddings}
}
@InProceedings{berman_et_al:LIPIcs.SoCG.2016.17,
author = {Berman, Piotr and Murzabulatov, Meiram and Raskhodnikova, Sofya},
title = {{Testing Convexity of Figures Under the Uniform Distribution}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {17:1--17:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.17},
URN = {urn:nbn:de:0030-drops-59094},
doi = {10.4230/LIPIcs.SoCG.2016.17},
annote = {Keywords: Convex sets, 2D geometry, randomized algorithms, property testing}
}
@InProceedings{bhattiprolu_et_al:LIPIcs.SoCG.2016.18,
author = {Bhattiprolu, Vijay V. S. P. and Har-Peled, Sariel},
title = {{Separating a Voronoi Diagram via Local Search}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {18:1--18:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.18},
URN = {urn:nbn:de:0030-drops-59107},
doi = {10.4230/LIPIcs.SoCG.2016.18},
annote = {Keywords: Separators, Local search, Approximation, Voronoi diagrams, Delaunay triangulation, Meshing, Geometric hitting set}
}
@InProceedings{biedl_et_al:LIPIcs.SoCG.2016.19,
author = {Biedl, Therese and Liotta, Giuseppe and Montecchiani, Fabrizio},
title = {{On Visibility Representations of Non-Planar Graphs}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {19:1--19:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.19},
URN = {urn:nbn:de:0030-drops-59116},
doi = {10.4230/LIPIcs.SoCG.2016.19},
annote = {Keywords: Visibility Representations, 1-Planarity, Recognition Algorithm, Forbidden Configuration}
}
@InProceedings{bogdanov_et_al:LIPIcs.SoCG.2016.20,
author = {Bogdanov, Mikhail and Teillaud, Monique and Vegter, Gert},
title = {{Delaunay Triangulations on Orientable Surfaces of Low Genus}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {20:1--20:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.20},
URN = {urn:nbn:de:0030-drops-59129},
doi = {10.4230/LIPIcs.SoCG.2016.20},
annote = {Keywords: covering spaces, hyperbolic surfaces, finitely presented groups, Fuchsian groups, systole}
}
@InProceedings{bohler_et_al:LIPIcs.SoCG.2016.21,
author = {Bohler, Cecilia and Klein, Rolf and Liu, Chih-Hung},
title = {{An Efficient Randomized Algorithm for Higher-Order Abstract Voronoi Diagrams}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.21},
URN = {urn:nbn:de:0030-drops-59135},
doi = {10.4230/LIPIcs.SoCG.2016.21},
annote = {Keywords: Order-k Voronoi Diagrams, Abstract Voronoi Diagrams, Randomized Geometric Algorithms}
}
@InProceedings{borradaile_et_al:LIPIcs.SoCG.2016.22,
author = {Borradaile, Glencora and Eppstein, David and Nayyeri, Amir and Wulff-Nilsen, Christian},
title = {{All-Pairs Minimum Cuts in Near-Linear Time for Surface-Embedded Graphs}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {22:1--22:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.22},
URN = {urn:nbn:de:0030-drops-59149},
doi = {10.4230/LIPIcs.SoCG.2016.22},
annote = {Keywords: minimum cuts, surface-embedded graphs, Gomory-Hu tree}
}
@InProceedings{borradaile_et_al:LIPIcs.SoCG.2016.23,
author = {Borradaile, Glencora and Chambers, Erin Wolf and Fox, Kyle and Nayyeri, Amir},
title = {{Minimum Cycle and Homology Bases of Surface Embedded Graphs}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {23:1--23:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.23},
URN = {urn:nbn:de:0030-drops-59152},
doi = {10.4230/LIPIcs.SoCG.2016.23},
annote = {Keywords: Cycle basis, Homology basis, Topological graph theory}
}
@InProceedings{burton_et_al:LIPIcs.SoCG.2016.24,
author = {Burton, Benjamin A. and de Mesmay, Arnaud and Wagner, Uli},
title = {{Finding Non-Orientable Surfaces in 3-Manifolds}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {24:1--24:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.24},
URN = {urn:nbn:de:0030-drops-59168},
doi = {10.4230/LIPIcs.SoCG.2016.24},
annote = {Keywords: 3-manifold, low-dimensional topology, embedding, non-orientability, normal surfaces}
}
@InProceedings{carriere_et_al:LIPIcs.SoCG.2016.25,
author = {Carri\`{e}re, Mathieu and Oudot, Steve},
title = {{Structure and Stability of the 1-Dimensional Mapper}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {25:1--25:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.25},
URN = {urn:nbn:de:0030-drops-59175},
doi = {10.4230/LIPIcs.SoCG.2016.25},
annote = {Keywords: Mapper, Reeb Graph, Extended Persistence, Topological Data Analysis}
}
@InProceedings{cevallos_et_al:LIPIcs.SoCG.2016.26,
author = {Cevallos, Alfonso and Eisenbrand, Friedrich and Zenklusen, Rico},
title = {{Max-Sum Diversity Via Convex Programming}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {26:1--26:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.26},
URN = {urn:nbn:de:0030-drops-59186},
doi = {10.4230/LIPIcs.SoCG.2016.26},
annote = {Keywords: Geometric Dispersion, Embeddings, Approximation Algorithms, Convex Programming, Matroids}
}
@InProceedings{chan:LIPIcs.SoCG.2016.27,
author = {Chan, Timothy M.},
title = {{Dynamic Streaming Algorithms for Epsilon-Kernels}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {27:1--27:11},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.27},
URN = {urn:nbn:de:0030-drops-59198},
doi = {10.4230/LIPIcs.SoCG.2016.27},
annote = {Keywords: coresets, streaming algorithms, dynamic algorithms, polynomial method, randomization, outliers}
}
@InProceedings{chan_et_al:LIPIcs.SoCG.2016.28,
author = {Chan, Timothy M. and Pratt, Simon},
title = {{Two Approaches to Building Time-Windowed Geometric Data Structures}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {28:1--28:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.28},
URN = {urn:nbn:de:0030-drops-59201},
doi = {10.4230/LIPIcs.SoCG.2016.28},
annote = {Keywords: time window, geometric data structures, range searching, dynamic convex hull}
}
@InProceedings{chang_et_al:LIPIcs.SoCG.2016.29,
author = {Chang, Hsien-Chih and Erickson, Jeff},
title = {{Untangling Planar Curves}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {29:1--29:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.29},
URN = {urn:nbn:de:0030-drops-59218},
doi = {10.4230/LIPIcs.SoCG.2016.29},
annote = {Keywords: computational topology, homotopy, planar graphs, Delta-Y transformations, defect, Reidemeister moves, tangles}
}
@InProceedings{chimani_et_al:LIPIcs.SoCG.2016.30,
author = {Chimani, Markus and Hlinen\'{y}, Petr},
title = {{Inserting Multiple Edges into a Planar Graph}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {30:1--30:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.30},
URN = {urn:nbn:de:0030-drops-59223},
doi = {10.4230/LIPIcs.SoCG.2016.30},
annote = {Keywords: crossing number, edge insertion, parameterized complexity, path homotopy, funnel algorithm}
}
@InProceedings{choudhary_et_al:LIPIcs.SoCG.2016.31,
author = {Choudhary, Aruni and Kerber, Michael and Raghvendra, Sharath},
title = {{Polynomial-Sized Topological Approximations Using the Permutahedron}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {31:1--31:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.31},
URN = {urn:nbn:de:0030-drops-59236},
doi = {10.4230/LIPIcs.SoCG.2016.31},
annote = {Keywords: Persistent Homology, Topological Data Analysis, Simplicial Approximation, Permutahedron, Approximation Algorithms}
}
@InProceedings{deberg_et_al:LIPIcs.SoCG.2016.32,
author = {de Berg, Mark and Gudmundsson, Joachim and Mehr, Mehran},
title = {{Faster Algorithms for Computing Plurality Points}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {32:1--32:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.32},
URN = {urn:nbn:de:0030-drops-59248},
doi = {10.4230/LIPIcs.SoCG.2016.32},
annote = {Keywords: computational geometry, computational social choice, voting theory, plurality points, Condorcet points}
}
@InProceedings{devillers_et_al:LIPIcs.SoCG.2016.33,
author = {Devillers, Olivier and Karavelas, Menelaos and Teillaud, Monique},
title = {{Qualitative Symbolic Perturbation}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {33:1--33:17},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.33},
URN = {urn:nbn:de:0030-drops-59259},
doi = {10.4230/LIPIcs.SoCG.2016.33},
annote = {Keywords: Robustness issues, Symbolic perturbations, Apollonius diagram}
}
@InProceedings{ding_et_al:LIPIcs.SoCG.2016.34,
author = {Ding, Hu and Gao, Jing and Xu, Jinhui},
title = {{Finding Global Optimum for Truth Discovery: Entropy Based Geometric Variance}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {34:1--34:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.34},
URN = {urn:nbn:de:0030-drops-59264},
doi = {10.4230/LIPIcs.SoCG.2016.34},
annote = {Keywords: geometric optimization, data mining, high dimension, entropy}
}
@InProceedings{dotterrer_et_al:LIPIcs.SoCG.2016.35,
author = {Dotterrer, Dominic and Kaufman, Tali and Wagner, Uli},
title = {{On Expansion and Topological Overlap}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {35:1--35:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.35},
URN = {urn:nbn:de:0030-drops-59270},
doi = {10.4230/LIPIcs.SoCG.2016.35},
annote = {Keywords: Combinatorial Topology, Selection Lemmas, Higher-Dimensional Expanders}
}
@InProceedings{dumitrescu_et_al:LIPIcs.SoCG.2016.36,
author = {Dumitrescu, Adrian and Jiang, Minghui},
title = {{On the Number of Maximum Empty Boxes Amidst n Points}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {36:1--36:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.36},
URN = {urn:nbn:de:0030-drops-59281},
doi = {10.4230/LIPIcs.SoCG.2016.36},
annote = {Keywords: Maximum empty box, Davenport-Schinzel sequence, approximation algorithm, data mining.}
}
@InProceedings{felsner_et_al:LIPIcs.SoCG.2016.37,
author = {Felsner, Stefan and Igamberdiev, Alexander and Kindermann, Philipp and Klemz, Boris and Mchedlidze, Tamara and Scheucher, Manfred},
title = {{Strongly Monotone Drawings of Planar Graphs}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {37:1--37:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.37},
URN = {urn:nbn:de:0030-drops-59292},
doi = {10.4230/LIPIcs.SoCG.2016.37},
annote = {Keywords: graph drawing, planar graphs, strongly monotone, strictly convex, primal-dual circle packing}
}
@InProceedings{fink_et_al:LIPIcs.SoCG.2016.38,
author = {Fink, Martin and Hershberger, John and Kumar, Nirman and Suri, Subhash},
title = {{Hyperplane Separability and Convexity of Probabilistic Point Sets}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {38:1--38:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.38},
URN = {urn:nbn:de:0030-drops-59305},
doi = {10.4230/LIPIcs.SoCG.2016.38},
annote = {Keywords: probabilistic separability, uncertain data, 3-SUM hardness, topological sweep, hyperplane separation, multi-dimensional data}
}
@InProceedings{fomin_et_al:LIPIcs.SoCG.2016.39,
author = {Fomin, Fedor and Kolay, Sudeshna and Lokshtanov, Daniel and Panolan, Fahad and Saurabh, Saket},
title = {{Subexponential Algorithms for Rectilinear Steiner Tree and Arborescence Problems}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {39:1--39:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.39},
URN = {urn:nbn:de:0030-drops-59310},
doi = {10.4230/LIPIcs.SoCG.2016.39},
annote = {Keywords: Rectilinear graphs, Steiner arborescence, parameterized algorithms}
}
@InProceedings{gartner_et_al:LIPIcs.SoCG.2016.40,
author = {G\"{a}rtner, Bernd and Lengler, Johannes and Szedl\'{a}k, May},
title = {{Random Sampling with Removal}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {40:1--40:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.40},
URN = {urn:nbn:de:0030-drops-59328},
doi = {10.4230/LIPIcs.SoCG.2016.40},
annote = {Keywords: LP-type problem, violator space, random sampling, sampling with removal}
}
@InProceedings{geyer_et_al:LIPIcs.SoCG.2016.41,
author = {Geyer, Markus and Hoffmann, Michael and Kaufmann, Michael and Kusters, Vincent and T\'{o}th, Csaba},
title = {{The Planar Tree Packing Theorem}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {41:1--41:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.41},
URN = {urn:nbn:de:0030-drops-59337},
doi = {10.4230/LIPIcs.SoCG.2016.41},
annote = {Keywords: graph drawing, simultaneous embedding, planar graph, graph packin}
}
@InProceedings{hlineny_et_al:LIPIcs.SoCG.2016.42,
author = {Hlinen\'{y}, Petr and Dern\'{a}r, Marek},
title = {{Crossing Number is Hard for Kernelization}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {42:1--42:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.42},
URN = {urn:nbn:de:0030-drops-59347},
doi = {10.4230/LIPIcs.SoCG.2016.42},
annote = {Keywords: crossing number; tile crossing number; parameterized complexity; polynomial kernel; cross-composition}
}
@InProceedings{hubard_et_al:LIPIcs.SoCG.2016.43,
author = {Hubard, Alfredo and Kalu\v{z}a, Vojtech and de Mesmay, Arnaud and Tancer, Martin},
title = {{Shortest Path Embeddings of Graphs on Surfaces}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {43:1--43:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.43},
URN = {urn:nbn:de:0030-drops-59356},
doi = {10.4230/LIPIcs.SoCG.2016.43},
annote = {Keywords: Graph embedding, surface, shortest path, crossing number, hyperbolic geometry}
}
@InProceedings{indyk_et_al:LIPIcs.SoCG.2016.44,
author = {Indyk, Piotr and Kleinberg, Robert and Mahabadi, Sepideh and Yuan, Yang},
title = {{Simultaneous Nearest Neighbor Search}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {44:1--44:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.44},
URN = {urn:nbn:de:0030-drops-59360},
doi = {10.4230/LIPIcs.SoCG.2016.44},
annote = {Keywords: Approximate Nearest Neighbor, Metric Labeling, 0-extension, Simultaneous Nearest Neighbor, Group Nearest Neighbor}
}
@InProceedings{kanj_et_al:LIPIcs.SoCG.2016.45,
author = {Kanj, Iyad and Perkovic, Ljubomir and T\"{u}rkoglu, Duru},
title = {{Degree Four Plane Spanners: Simpler and Better}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {45:1--45:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.45},
URN = {urn:nbn:de:0030-drops-59376},
doi = {10.4230/LIPIcs.SoCG.2016.45},
annote = {Keywords: Nonnumerical Algorithms and Problems,Computational Geometry and Object Modeling}
}
@InProceedings{kawamura_et_al:LIPIcs.SoCG.2016.46,
author = {Kawamura, Akitoshi and Moriyama, Sonoko and Otachi, Yota and Pach, J\'{a}nos},
title = {{A Lower Bound on Opaque Sets}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {46:1--46:10},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.46},
URN = {urn:nbn:de:0030-drops-59386},
doi = {10.4230/LIPIcs.SoCG.2016.46},
annote = {Keywords: barriers; Cauchy-Crofton formula; lower bound; opaque sets}
}
@InProceedings{khoury_et_al:LIPIcs.SoCG.2016.47,
author = {Khoury, Marc and Shewchuk, Jonathan Richard},
title = {{Fixed Points of the Restricted Delaunay Triangulation Operator}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {47:1--47:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.47},
URN = {urn:nbn:de:0030-drops-59396},
doi = {10.4230/LIPIcs.SoCG.2016.47},
annote = {Keywords: restricted Delaunay triangulation, fixed point, manifold reconstruction, surface reconstruction, computational geometry}
}
@InProceedings{kim_et_al:LIPIcs.SoCG.2016.48,
author = {Kim, Heuna and Rote, G\"{u}nter},
title = {{Congruence Testing of Point Sets in 4-Space}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {48:1--48:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.48},
URN = {urn:nbn:de:0030-drops-59409},
doi = {10.4230/LIPIcs.SoCG.2016.48},
annote = {Keywords: Congruence Testing Algorithm, Symmetry, Computational Geometry}
}
@InProceedings{kostitsyna_et_al:LIPIcs.SoCG.2016.49,
author = {Kostitsyna, Irina and L\"{o}ffler, Maarten and Polishchuk, Valentin and Staals, Frank},
title = {{On the Complexity of Minimum-Link Path Problems}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {49:1--49:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.49},
URN = {urn:nbn:de:0030-drops-59412},
doi = {10.4230/LIPIcs.SoCG.2016.49},
annote = {Keywords: minimum-linkpath, diffuse reflection, terrain, bit complexity, NP-hardness}
}
@InProceedings{langerman_et_al:LIPIcs.SoCG.2016.50,
author = {Langerman, Stefan and Winslow, Andrew},
title = {{A Quasilinear-Time Algorithm for Tiling the Plane Isohedrally with a Polyomino}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {50:1--50:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.50},
URN = {urn:nbn:de:0030-drops-59423},
doi = {10.4230/LIPIcs.SoCG.2016.50},
annote = {Keywords: Plane tiling, polyomino, boundary word, isohedral}
}
@InProceedings{mabillard_et_al:LIPIcs.SoCG.2016.51,
author = {Mabillard, Isaac and Wagner, Uli},
title = {{Eliminating Higher-Multiplicity Intersections, II. The Deleted Product Criterion in the r-Metastable Range}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {51:1--51:12},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.51},
URN = {urn:nbn:de:0030-drops-59438},
doi = {10.4230/LIPIcs.SoCG.2016.51},
annote = {Keywords: Topological Combinatorics, Tverberg-Type Problems, Simplicial Complexes, Piecewise-Linear Topology, Haefliger-Weber Theorem}
}
@InProceedings{marx_et_al:LIPIcs.SoCG.2016.52,
author = {Marx, D\'{a}niel and Miltzow, Tillmann},
title = {{Peeling and Nibbling the Cactus: Subexponential-Time Algorithms for Counting Triangulations and Related Problems}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {52:1--52:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.52},
URN = {urn:nbn:de:0030-drops-59445},
doi = {10.4230/LIPIcs.SoCG.2016.52},
annote = {Keywords: computational geometry, triangulations, exponential-time algorithms}
}
@InProceedings{munch_et_al:LIPIcs.SoCG.2016.53,
author = {Munch, Elizabeth and Wang, Bei},
title = {{Convergence between Categorical Representations of Reeb Space and Mapper}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {53:1--53:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.53},
URN = {urn:nbn:de:0030-drops-59454},
doi = {10.4230/LIPIcs.SoCG.2016.53},
annote = {Keywords: Topological data analysis, Reeb space, mapper, category theory}
}
@InProceedings{kupavskii_et_al:LIPIcs.SoCG.2016.54,
author = {Kupavskii, Andrey and Mustafa, Nabil and Pach, J\'{a}nos},
title = {{New Lower Bounds for epsilon-Nets}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {54:1--54:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.54},
URN = {urn:nbn:de:0030-drops-59467},
doi = {10.4230/LIPIcs.SoCG.2016.54},
annote = {Keywords: epsilon-nets; lower bounds; geometric set systems; shallow-cell complexity; half-spaces}
}
@InProceedings{nayyeri_et_al:LIPIcs.SoCG.2016.55,
author = {Nayyeri, Amir and Xu, Hanzhong},
title = {{On Computing the Fr\'{e}chet Distance Between Surfaces}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {55:1--55:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.55},
URN = {urn:nbn:de:0030-drops-59471},
doi = {10.4230/LIPIcs.SoCG.2016.55},
annote = {Keywords: Surfaces, Terrains, Frechet distance, Parametrized complexity, normal coordinates}
}
@InProceedings{oh_et_al:LIPIcs.SoCG.2016.56,
author = {Oh, Eunjin and Barba, Luis and Ahn, Hee-Kap},
title = {{The Farthest-Point Geodesic Voronoi Diagram of Points on the Boundary of a Simple Polygon}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {56:1--56:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.56},
URN = {urn:nbn:de:0030-drops-59481},
doi = {10.4230/LIPIcs.SoCG.2016.56},
annote = {Keywords: Geodesic distance, simple polygons, farthest-point Voronoi diagram}
}
@InProceedings{raichel_et_al:LIPIcs.SoCG.2016.57,
author = {Raichel, Benjamin and Seshadhri, C.},
title = {{Avoiding the Global Sort: A Faster Contour Tree Algorithm}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {57:1--57:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.57},
URN = {urn:nbn:de:0030-drops-59490},
doi = {10.4230/LIPIcs.SoCG.2016.57},
annote = {Keywords: contour trees, computational topology, computational geometry}
}
@InProceedings{raz:LIPIcs.SoCG.2016.58,
author = {Raz, Orit E.},
title = {{Configurations of Lines in 3-Space and Rigidity of Planar Structures}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {58:1--58:14},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.58},
URN = {urn:nbn:de:0030-drops-59503},
doi = {10.4230/LIPIcs.SoCG.2016.58},
annote = {Keywords: Line configurations, Rigidity, Global Rigidity, Laman graphs}
}
@InProceedings{rok_et_al:LIPIcs.SoCG.2016.59,
author = {Rok, Alexandre and Smorodinsky, Shakhar},
title = {{Weak 1/r-Nets for Moving Points}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {59:1--59:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.59},
URN = {urn:nbn:de:0030-drops-59514},
doi = {10.4230/LIPIcs.SoCG.2016.59},
annote = {Keywords: Hypergraphs, Weak epsilon-net}
}
@InProceedings{afshani_et_al:LIPIcs.SoCG.2016.60,
author = {Afshani, Peyman and Berglin, Edvin and van Duijn, Ingo and Sindahl Nielsen, Jesper},
title = {{Applications of Incidence Bounds in Point Covering Problems}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {60:1--60:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.60},
URN = {urn:nbn:de:0030-drops-59527},
doi = {10.4230/LIPIcs.SoCG.2016.60},
annote = {Keywords: Point Cover, Incidence Bounds, Inclusion Exclusion, Exponential Algorithm}
}
@InProceedings{vangoethem_et_al:LIPIcs.SoCG.2016.61,
author = {van Goethem, Arthur and van Kreveld, Marc and L\"{o}ffler, Maarten and Speckmann, Bettina and Staals, Frank},
title = {{Grouping Time-Varying Data for Interactive Exploration}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {61:1--61:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.61},
URN = {urn:nbn:de:0030-drops-59539},
doi = {10.4230/LIPIcs.SoCG.2016.61},
annote = {Keywords: Trajectory, Time series, Moving entity, Grouping, Algorithm, Data structure}
}
@InProceedings{xue_et_al:LIPIcs.SoCG.2016.62,
author = {Xue, Jie and Li, Yuan and Janardan, Ravi},
title = {{On the Separability of Stochastic Geometric Objects, with Applications}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {62:1--62:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.62},
URN = {urn:nbn:de:0030-drops-59544},
doi = {10.4230/LIPIcs.SoCG.2016.62},
annote = {Keywords: Stochastic objects, linear separability, separable-probability, expected separation-margin, convex hull}
}
@InProceedings{yon_et_al:LIPIcs.SoCG.2016.63,
author = {Yon, Juyoung and Bae, Sang Won and Cheng, Siu-Wing and Cheong, Otfried and Wilkinson, Bryan T.},
title = {{Approximating Convex Shapes With Respect to Symmetric Difference Under Homotheties}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {63:1--63:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.63},
URN = {urn:nbn:de:0030-drops-59551},
doi = {10.4230/LIPIcs.SoCG.2016.63},
annote = {Keywords: shape matching, convexity, symmetric difference, homotheties}
}
@InProceedings{gardner_et_al:LIPIcs.SoCG.2016.64,
author = {Gardner, Kirk and Asselin, Lynn and Sheehy, Donald},
title = {{Interactive Geometric Algorithm Visualization in a Browser}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {64:1--64:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.64},
URN = {urn:nbn:de:0030-drops-59563},
doi = {10.4230/LIPIcs.SoCG.2016.64},
annote = {Keywords: Computational Geometry, Processing, JavaScript, Visualisation, Incremental Algorithms}
}
@InProceedings{bendich_et_al:LIPIcs.SoCG.2016.65,
author = {Bendich, Paul and Gasparovic, Ellen and Harer, John and Tralie, Christopher},
title = {{Geometric Models for Musical Audio Data}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {65:1--65:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.65},
URN = {urn:nbn:de:0030-drops-59577},
doi = {10.4230/LIPIcs.SoCG.2016.65},
annote = {Keywords: Geometric Models, Audio Analysis, High Dimensional Data Analysis, Stratified Space Models}
}
@InProceedings{devadoss_et_al:LIPIcs.SoCG.2016.66,
author = {Devadoss, Satyan and Epstein, Ziv and Smirnov, Dmitriy},
title = {{Visualizing Scissors Congruence}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {66:1--66:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.66},
URN = {urn:nbn:de:0030-drops-59585},
doi = {10.4230/LIPIcs.SoCG.2016.66},
annote = {Keywords: polygonal congruence, geometry, rigid transformations}
}
@InProceedings{farshi_et_al:LIPIcs.SoCG.2016.67,
author = {Farshi, Mohammad and Hosseini, Seyed Hossein},
title = {{Visualization of Geometric Spanner Algorithms}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {67:1--67:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.67},
URN = {urn:nbn:de:0030-drops-59594},
doi = {10.4230/LIPIcs.SoCG.2016.67},
annote = {Keywords: geometric spanner networks, geometric spanner algorithms animations.}
}
@InProceedings{hsu_et_al:LIPIcs.SoCG.2016.68,
author = {Hsu, Ching-Hsiang and Ryan, John Paul and Yap, Chee},
title = {{Path Planning for Simple Robots using Soft Subdivision Search}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {68:1--68:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.68},
URN = {urn:nbn:de:0030-drops-59607},
doi = {10.4230/LIPIcs.SoCG.2016.68},
annote = {Keywords: Robot Path Planning, Soft Predicates, Resolution-Exact Algorithm, Subdivision Search}
}
@InProceedings{pratt_et_al:LIPIcs.SoCG.2016.69,
author = {Pratt, Kevin and Riley, Connor and Sheehy, Donald},
title = {{Exploring Circle Packing Algorithms}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {69:1--69:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.69},
URN = {urn:nbn:de:0030-drops-59616},
doi = {10.4230/LIPIcs.SoCG.2016.69},
annote = {Keywords: Computational Geometry, Processing, Javascript, Visualization, Incremental Algorithms}
}
@InProceedings{vantoll_et_al:LIPIcs.SoCG.2016.70,
author = {van Toll, Wouter and Cook IV, Atlas F. and van Kreveld, Marc and Geraerts, Roland},
title = {{The Explicit Corridor Map: Using the Medial Axis for Real-Time Path Planning and Crowd Simulation}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {70:1--70:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.70},
URN = {urn:nbn:de:0030-drops-59622},
doi = {10.4230/LIPIcs.SoCG.2016.70},
annote = {Keywords: Medial axis, Navigation mesh, Path planning, Crowd simulation}
}
@InProceedings{tralie:LIPIcs.SoCG.2016.71,
author = {Tralie, Christopher},
title = {{High-Dimensional Geometry of Sliding Window Embeddings of Periodic Videos}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {71:1--71:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.71},
URN = {urn:nbn:de:0030-drops-59630},
doi = {10.4230/LIPIcs.SoCG.2016.71},
annote = {Keywords: Video Processing, High Dimensional Geometry, Circular Coordinates, Nonlinear Time Series}
}
@InProceedings{wright:LIPIcs.SoCG.2016.72,
author = {Wright, Matthew L.},
title = {{Introduction to Persistent Homology}},
booktitle = {32nd International Symposium on Computational Geometry (SoCG 2016)},
pages = {72:1--72:3},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-009-5},
ISSN = {1868-8969},
year = {2016},
volume = {51},
editor = {Fekete, S\'{a}ndor and Lubiw, Anna},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2016.72},
URN = {urn:nbn:de:0030-drops-59643},
doi = {10.4230/LIPIcs.SoCG.2016.72},
annote = {Keywords: Persistent Homology, Topological Data Analysi}
}
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