@Proceedings{aronov_et_al:LIPIcs.SoCG.2017,
title = {{LIPIcs, Volume 77, SoCG'17, Complete Volume}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017},
URN = {urn:nbn:de:0030-drops-73012},
doi = {10.4230/LIPIcs.SoCG.2017},
annote = {Keywords: Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Geometrical problems and computations, Discrete Mathematics}
}
@InProceedings{aronov_et_al:LIPIcs.SoCG.2017.0,
author = {Aronov, Boris and Katz, Matthew J.},
title = {{Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {0:i--0:xviii},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.0},
URN = {urn:nbn:de:0030-drops-71770},
doi = {10.4230/LIPIcs.SoCG.2017.0},
annote = {Keywords: Front Matter, Table of Contents, Foreword, Conference Organization, External Reviewers, Sponsors}
}
@InProceedings{robins:LIPIcs.SoCG.2017.1,
author = {Robins, Vanessa},
title = {{The Geometry and Topology of Crystals: From Sphere-Packing to Tiling, Nets, and Knots}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {1:1--1:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.1},
URN = {urn:nbn:de:0030-drops-72374},
doi = {10.4230/LIPIcs.SoCG.2017.1},
annote = {Keywords: Mathematical crystallography, Combinatorial tiling theory, Graphs and surfaces in the 3-torus}
}
@InProceedings{sharir:LIPIcs.SoCG.2017.2,
author = {Sharir, Micha},
title = {{The Algebraic Revolution in Combinatorial and Computational Geometry: State of the Art}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {2:1--2:1},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.2},
URN = {urn:nbn:de:0030-drops-72384},
doi = {10.4230/LIPIcs.SoCG.2017.2},
annote = {Keywords: Combinatorial Geometry, Incidences, Polynomial method, Algebraic Geometry, Distances}
}
@InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2017.3,
author = {Abrahamsen, Mikkel and Adamaszek, Anna and Miltzow, Tillmann},
title = {{Irrational Guards are Sometimes Needed}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {3:1--3:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.3},
URN = {urn:nbn:de:0030-drops-71946},
doi = {10.4230/LIPIcs.SoCG.2017.3},
annote = {Keywords: art gallery problem, computational geometry, irrational numbers}
}
@InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2017.4,
author = {Abrahamsen, Mikkel and de Berg, Mark and Buchin, Kevin and Mehr, Mehran and Mehrabi, Ali D.},
title = {{Minimum Perimeter-Sum Partitions in the Plane}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {4:1--4:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.4},
URN = {urn:nbn:de:0030-drops-72048},
doi = {10.4230/LIPIcs.SoCG.2017.4},
annote = {Keywords: Computational geometry, clustering, minimum-perimeter partition, convex hull}
}
@InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2017.5,
author = {Abrahamsen, Mikkel and de Berg, Mark and Buchin, Kevin and Mehr, Mehran and Mehrabi, Ali D.},
title = {{Range-Clustering Queries}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {5:1--5:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.5},
URN = {urn:nbn:de:0030-drops-72147},
doi = {10.4230/LIPIcs.SoCG.2017.5},
annote = {Keywords: Geometric data structures, clustering, k-center problem}
}
@InProceedings{abrahamsen_et_al:LIPIcs.SoCG.2017.6,
author = {Abrahamsen, Mikkel and Holm, Jacob and Rotenberg, Eva and Wulff-Nilsen, Christian},
title = {{Best Laid Plans of Lions and Men}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {6:1--6:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.6},
URN = {urn:nbn:de:0030-drops-72053},
doi = {10.4230/LIPIcs.SoCG.2017.6},
annote = {Keywords: Lion and man game, Pursuit evasion game, Winning strategy}
}
@InProceedings{agarwal_et_al:LIPIcs.SoCG.2017.7,
author = {Agarwal, Pankaj K. and Fox, Kyle and Panigrahi, Debmalya and Varadarajan, Kasturi R. and Xiao, Allen},
title = {{Faster Algorithms for the Geometric Transportation Problem}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {7:1--7:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.7},
URN = {urn:nbn:de:0030-drops-72344},
doi = {10.4230/LIPIcs.SoCG.2017.7},
annote = {Keywords: transportation map, earth mover's distance, shape matching, approximation algorithms}
}
@InProceedings{aichholzer_et_al:LIPIcs.SoCG.2017.8,
author = {Aichholzer, Oswin and Balko, Martin and Hackl, Thomas and Kyncl, Jan and Parada, Irene and Scheucher, Manfred and Valtr, Pavel and Vogtenhuber, Birgit},
title = {{A Superlinear Lower Bound on the Number of 5-Holes}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {8:1--8:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.8},
URN = {urn:nbn:de:0030-drops-72008},
doi = {10.4230/LIPIcs.SoCG.2017.8},
annote = {Keywords: Erd\"{o}s-Szekeres type problem, k-hole, empty k-gon, empty pentagon, planar point set}
}
@InProceedings{angelini_et_al:LIPIcs.SoCG.2017.9,
author = {Angelini, Patrizio and Bekos, Michael A. and Liotta, Giuseppe and Montecchiani, Fabrizio},
title = {{A Universal Slope Set for 1-Bend Planar Drawings}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {9:1--9:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.9},
URN = {urn:nbn:de:0030-drops-71917},
doi = {10.4230/LIPIcs.SoCG.2017.9},
annote = {Keywords: Slope number, 1-bend drawings, planar graphs, angular resolution}
}
@InProceedings{arya_et_al:LIPIcs.SoCG.2017.10,
author = {Arya, Sunil and da Fonseca, Guilherme D. and Mount, David M.},
title = {{Near-Optimal epsilon-Kernel Construction and Related Problems}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {10:1--10:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.10},
URN = {urn:nbn:de:0030-drops-72257},
doi = {10.4230/LIPIcs.SoCG.2017.10},
annote = {Keywords: Approximation, diameter, kernel, coreset, nearest neighbor, polytope membership, bichromatic closest pair, Macbeath regions}
}
@InProceedings{ashok_et_al:LIPIcs.SoCG.2017.11,
author = {Ashok, Pradeesha and Fomin, Fedor V. and Kolay, Sudeshna and Saurabh, Saket and Zehavi, Meirav},
title = {{Exact Algorithms for Terrain Guarding}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {11:1--11:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.11},
URN = {urn:nbn:de:0030-drops-71975},
doi = {10.4230/LIPIcs.SoCG.2017.11},
annote = {Keywords: Terrain Guarding, Art Gallery, Exponential-Time Algorithms}
}
@InProceedings{balko_et_al:LIPIcs.SoCG.2017.12,
author = {Balko, Martin and Cibulka, Josef and Valtr, Pavel},
title = {{Covering Lattice Points by Subspaces and Counting Point-Hyperplane Incidences}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {12:1--12:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.12},
URN = {urn:nbn:de:0030-drops-71955},
doi = {10.4230/LIPIcs.SoCG.2017.12},
annote = {Keywords: lattice point, covering, linear subspace, point-hyperplane incidence}
}
@InProceedings{barba_et_al:LIPIcs.SoCG.2017.13,
author = {Barba, Luis and Cardinal, Jean and Iacono, John and Langerman, Stefan and Ooms, Aur\'{e}lien and Solomon, Noam},
title = {{Subquadratic Algorithms for Algebraic Generalizations of 3SUM}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {13:1--13:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.13},
URN = {urn:nbn:de:0030-drops-72214},
doi = {10.4230/LIPIcs.SoCG.2017.13},
annote = {Keywords: 3SUM, subquadratic algorithms, general position testing, range searching, dominance reporting, polynomial curves}
}
@InProceedings{barth_et_al:LIPIcs.SoCG.2017.14,
author = {Barth, Lukas and Niedermann, Benjamin and Rutter, Ignaz and Wolf, Matthias},
title = {{Towards a Topology-Shape-Metrics Framework for Ortho-Radial Drawings}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {14:1--14:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.14},
URN = {urn:nbn:de:0030-drops-72234},
doi = {10.4230/LIPIcs.SoCG.2017.14},
annote = {Keywords: Graph Drawing, Ortho-Radial Drawings, Combinatorial Characterization, Bend Minimization, Topology-Shape-Metrics}
}
@InProceedings{basit_et_al:LIPIcs.SoCG.2017.15,
author = {Basit, Abdul and Dvir, Zeev and Saraf, Shubhangi and Wolf, Charles},
title = {{On the Number of Ordinary Lines Determined by Sets in Complex Space}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {15:1--15:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.15},
URN = {urn:nbn:de:0030-drops-71883},
doi = {10.4230/LIPIcs.SoCG.2017.15},
annote = {Keywords: Incidences, Combinatorial Geometry, Designs, Polynomial Method}
}
@InProceedings{bekos_et_al:LIPIcs.SoCG.2017.16,
author = {Bekos, Michael A. and Kaufmann, Michael and Raftopoulou, Chrysanthi N.},
title = {{On Optimal 2- and 3-Planar Graphs}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {16:1--16:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.16},
URN = {urn:nbn:de:0030-drops-72307},
doi = {10.4230/LIPIcs.SoCG.2017.16},
annote = {Keywords: topological graphs, optimal k-planar graphs, characterization}
}
@InProceedings{binham_et_al:LIPIcs.SoCG.2017.17,
author = {Binham, Daniel and Manhaes de Castro, Pedro Machado and Vigneron, Antoine},
title = {{Reachability in a Planar Subdivision with Direction Constraints}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {17:1--17:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.17},
URN = {urn:nbn:de:0030-drops-72022},
doi = {10.4230/LIPIcs.SoCG.2017.17},
annote = {Keywords: Design and analysis of geometric algorithms, Path planning, Reachability}
}
@InProceedings{biro_et_al:LIPIcs.SoCG.2017.18,
author = {Bir\'{o}, Csaba and Bonnet, \'{E}douard and Marx, D\'{a}niel and Miltzow, Tillmann and Rzazewski, Pawel},
title = {{Fine-Grained Complexity of Coloring Unit Disks and Balls}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {18:1--18:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.18},
URN = {urn:nbn:de:0030-drops-71800},
doi = {10.4230/LIPIcs.SoCG.2017.18},
annote = {Keywords: unit disk graphs, unit ball graphs, coloring, exact algorithm}
}
@InProceedings{boissonnat_et_al:LIPIcs.SoCG.2017.19,
author = {Boissonnat, Jean-Daniel and Rouxel-Labb\'{e}, Mael and Wintraecken, Mathijs},
title = {{Anisotropic Triangulations via Discrete Riemannian Voronoi Diagrams}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {19:1--19:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.19},
URN = {urn:nbn:de:0030-drops-72060},
doi = {10.4230/LIPIcs.SoCG.2017.19},
annote = {Keywords: Riemannian Geometry, Voronoi diagram, Delaunay triangulation}
}
@InProceedings{bonnet_et_al:LIPIcs.SoCG.2017.20,
author = {Bonnet, \'{E}douard and Miltzow, Tillmann},
title = {{An Approximation Algorithm for the Art Gallery Problem}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {20:1--20:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.20},
URN = {urn:nbn:de:0030-drops-72150},
doi = {10.4230/LIPIcs.SoCG.2017.20},
annote = {Keywords: computational geometry, art gallery, approximation algorithm}
}
@InProceedings{bose_et_al:LIPIcs.SoCG.2017.21,
author = {Bose, Prosenjit and Kostitsyna, Irina and Langerman, Stefan},
title = {{Self-Approaching Paths in Simple Polygons}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {21:1--21:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.21},
URN = {urn:nbn:de:0030-drops-72166},
doi = {10.4230/LIPIcs.SoCG.2017.21},
annote = {Keywords: self-approaching path, simple polygon, shortest path, involute curve}
}
@InProceedings{bringmann_et_al:LIPIcs.SoCG.2017.22,
author = {Bringmann, Karl and Cabello, Sergio and Emmerich, Michael T. M.},
title = {{Maximum Volume Subset Selection for Anchored Boxes}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {22:1--22:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.22},
URN = {urn:nbn:de:0030-drops-72011},
doi = {10.4230/LIPIcs.SoCG.2017.22},
annote = {Keywords: geometric optimization, subset selection, hypervolume indicator, Klee’s 23 measure problem, boxes, NP-hardness, PTAS}
}
@InProceedings{buchet_et_al:LIPIcs.SoCG.2017.23,
author = {Buchet, Mickael and Dey, Tamal K. and Wang, Jiayuan and Wang, Yusu},
title = {{Declutter and Resample: Towards Parameter Free Denoising}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {23:1--23:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.23},
URN = {urn:nbn:de:0030-drops-72133},
doi = {10.4230/LIPIcs.SoCG.2017.23},
annote = {Keywords: denoising, parameter free, k-distance,compact sets}
}
@InProceedings{c.s._et_al:LIPIcs.SoCG.2017.24,
author = {C. S., Karthik and Saha, Arpan},
title = {{Ham Sandwich is Equivalent to Borsuk-Ulam}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {24:1--24:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.24},
URN = {urn:nbn:de:0030-drops-72325},
doi = {10.4230/LIPIcs.SoCG.2017.24},
annote = {Keywords: Ham Sandwich theorem, Borsuk-Ulam theorem, Query Complexity, Hyperspherical Harmonics}
}
@InProceedings{carriere_et_al:LIPIcs.SoCG.2017.25,
author = {Carri\`{e}re, Mathieu and Oudot, Steve},
title = {{Local Equivalence and Intrinsic Metrics between Reeb Graphs}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {25:1--25:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.25},
URN = {urn:nbn:de:0030-drops-71794},
doi = {10.4230/LIPIcs.SoCG.2017.25},
annote = {Keywords: Reeb Graphs, Extended Persistence, Induced Metrics, Topological Data Analysis}
}
@InProceedings{chan:LIPIcs.SoCG.2017.26,
author = {Chan, Timothy M.},
title = {{Applications of Chebyshev Polynomials to Low-Dimensional Computational Geometry}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {26:1--26:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.26},
URN = {urn:nbn:de:0030-drops-72279},
doi = {10.4230/LIPIcs.SoCG.2017.26},
annote = {Keywords: diameter, coresets, approximate nearest neighbor search, the polynomial method, streaming}
}
@InProceedings{chan:LIPIcs.SoCG.2017.27,
author = {Chan, Timothy M.},
title = {{Orthogonal Range Searching in Moderate Dimensions: k-d Trees and Range Trees Strike Back}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {27:1--27:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.27},
URN = {urn:nbn:de:0030-drops-72262},
doi = {10.4230/LIPIcs.SoCG.2017.27},
annote = {Keywords: computational geometry, data structures, range searching, nearest neighbor searching}
}
@InProceedings{chan_et_al:LIPIcs.SoCG.2017.28,
author = {Chan, Timothy M. and Tsakalidis, Konstantinos},
title = {{Dynamic Orthogonal Range Searching on the RAM, Revisited}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {28:1--28:13},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.28},
URN = {urn:nbn:de:0030-drops-72291},
doi = {10.4230/LIPIcs.SoCG.2017.28},
annote = {Keywords: dynamic data structures, range searching, computational geometry}
}
@InProceedings{chang_et_al:LIPIcs.SoCG.2017.29,
author = {Chang, Yi-Jun and Yen, Hsu-Chun},
title = {{On Bend-Minimized Orthogonal Drawings of Planar 3-Graphs}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {29:1--29:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.29},
URN = {urn:nbn:de:0030-drops-72080},
doi = {10.4230/LIPIcs.SoCG.2017.29},
annote = {Keywords: Bend minimization, graph drawing, orthogonal drawing, planar graph}
}
@InProceedings{cheng_et_al:LIPIcs.SoCG.2017.30,
author = {Cheng, Siu-Wing and Lau, Man-Kit},
title = {{Adaptive Planar Point Location}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {30:1--30:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.30},
URN = {urn:nbn:de:0030-drops-71897},
doi = {10.4230/LIPIcs.SoCG.2017.30},
annote = {Keywords: point location, planar subdivision, static optimality}
}
@InProceedings{chiu_et_al:LIPIcs.SoCG.2017.31,
author = {Chiu, Man-Kwun and Korman, Matias},
title = {{High Dimensional Consistent Digital Segments}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {31:1--31:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.31},
URN = {urn:nbn:de:0030-drops-71900},
doi = {10.4230/LIPIcs.SoCG.2017.31},
annote = {Keywords: Consistent Digital Line Segments, Digital Geometry, Computer Vision}
}
@InProceedings{citovsky_et_al:LIPIcs.SoCG.2017.32,
author = {Citovsky, Gui and Mayer, Tyler and Mitchell, Joseph S. B.},
title = {{TSP With Locational Uncertainty: The Adversarial Model}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {32:1--32:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.32},
URN = {urn:nbn:de:0030-drops-72334},
doi = {10.4230/LIPIcs.SoCG.2017.32},
annote = {Keywords: traveling salesperson problem, TSP with neighborhoods, approximation algorithms, uncertainty}
}
@InProceedings{dalozzo_et_al:LIPIcs.SoCG.2017.33,
author = {Da Lozzo, Giordano and D'Angelo, Anthony and Frati, Fabrizio},
title = {{On Planar Greedy Drawings of 3-Connected Planar Graphs}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {33:1--33:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.33},
URN = {urn:nbn:de:0030-drops-72095},
doi = {10.4230/LIPIcs.SoCG.2017.33},
annote = {Keywords: Greedy drawings, 3-connectivity, planar graphs, convex drawings}
}
@InProceedings{demaine_et_al:LIPIcs.SoCG.2017.34,
author = {Demaine, Erik D. and Tachi, Tomohiro},
title = {{Origamizer: A Practical Algorithm for Folding Any Polyhedron}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {34:1--34:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.34},
URN = {urn:nbn:de:0030-drops-72315},
doi = {10.4230/LIPIcs.SoCG.2017.34},
annote = {Keywords: origami, folding, polyhedra, Voronoi diagram, computational geometry}
}
@InProceedings{despre_et_al:LIPIcs.SoCG.2017.35,
author = {Despr\'{e}, Vincent and Lazarus, Francis},
title = {{Computing the Geometric Intersection Number of Curves}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {35:1--35:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.35},
URN = {urn:nbn:de:0030-drops-71838},
doi = {10.4230/LIPIcs.SoCG.2017.35},
annote = {Keywords: computational topology, curves on surfaces, combinatorial geodesic}
}
@InProceedings{dey_et_al:LIPIcs.SoCG.2017.36,
author = {Dey, Tamal K. and M\'{e}moli, Facundo and Wang, Yusu},
title = {{Topological Analysis of Nerves, Reeb Spaces, Mappers, and Multiscale Mappers}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {36:1--36:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.36},
URN = {urn:nbn:de:0030-drops-72220},
doi = {10.4230/LIPIcs.SoCG.2017.36},
annote = {Keywords: Topology, Nerves, Mapper, Multiscale Mapper, Reeb Spaces}
}
@InProceedings{driemel_et_al:LIPIcs.SoCG.2017.37,
author = {Driemel, Anne and Silvestri, Francesco},
title = {{Locality-Sensitive Hashing of Curves}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {37:1--37:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.37},
URN = {urn:nbn:de:0030-drops-72032},
doi = {10.4230/LIPIcs.SoCG.2017.37},
annote = {Keywords: Locality-Sensitive Hashing, Frechet distance, Dynamic Time Warping}
}
@InProceedings{dutta_et_al:LIPIcs.SoCG.2017.38,
author = {Dutta, Kunal and Ghosh, Arijit and Jartoux, Bruno and Mustafa, Nabil H.},
title = {{Shallow Packings, Semialgebraic Set Systems, Macbeath Regions, and Polynomial Partitioning}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {38:1--38:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.38},
URN = {urn:nbn:de:0030-drops-71991},
doi = {10.4230/LIPIcs.SoCG.2017.38},
annote = {Keywords: Epsilon-nets, Haussler's packing lemma, Mnets, shallow-cell complexity, shallow packing lemma}
}
@InProceedings{edelsbrunner_et_al:LIPIcs.SoCG.2017.39,
author = {Edelsbrunner, Herbert and Wagner, Hubert},
title = {{Topological Data Analysis with Bregman Divergences}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {39:1--39:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.39},
URN = {urn:nbn:de:0030-drops-71985},
doi = {10.4230/LIPIcs.SoCG.2017.39},
annote = {Keywords: Topological data analysis, Bregman divergences, persistent homology, proximity complexes, algorithms}
}
@InProceedings{elbassioni:LIPIcs.SoCG.2017.40,
author = {Elbassioni, Khaled},
title = {{Finding Small Hitting Sets in Infinite Range Spaces of Bounded VC-Dimension}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {40:1--40:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.40},
URN = {urn:nbn:de:0030-drops-72289},
doi = {10.4230/LIPIcs.SoCG.2017.40},
annote = {Keywords: VC-dimension, approximation algorithms, fractional covering, multiplicative weights update, art gallery problem, polyhedral separators, geometric cove}
}
@InProceedings{ezra_et_al:LIPIcs.SoCG.2017.41,
author = {Ezra, Esther and Sharir, Micha},
title = {{A Nearly Quadratic Bound for the Decision Tree Complexity of k-SUM}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {41:1--41:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.41},
URN = {urn:nbn:de:0030-drops-71853},
doi = {10.4230/LIPIcs.SoCG.2017.41},
annote = {Keywords: k-SUM and k-LDT, linear decision tree, hyperplane arrangements, point-location, vertical decompositions, Epsilon-cuttings}
}
@InProceedings{fan_et_al:LIPIcs.SoCG.2017.42,
author = {Fan, Chenglin and Raichel, Benjamin},
title = {{Computing the Fr\'{e}chet Gap Distance}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {42:1--42:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.42},
URN = {urn:nbn:de:0030-drops-71849},
doi = {10.4230/LIPIcs.SoCG.2017.42},
annote = {Keywords: Frechet Distance, Approximation, Polygonal Curves}
}
@InProceedings{fox_et_al:LIPIcs.SoCG.2017.43,
author = {Fox, Jacob and Pach, J\'{a}nos and Suk, Andrew},
title = {{Erd\"{o}s-Hajnal Conjecture for Graphs with Bounded VC-Dimension}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {43:1--43:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.43},
URN = {urn:nbn:de:0030-drops-72246},
doi = {10.4230/LIPIcs.SoCG.2017.43},
annote = {Keywords: VC-dimension, Ramsey theory, regularity lemma}
}
@InProceedings{iordanov_et_al:LIPIcs.SoCG.2017.44,
author = {Iordanov, Iordan and Teillaud, Monique},
title = {{Implementing Delaunay Triangulations of the Bolza Surface}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {44:1--44:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.44},
URN = {urn:nbn:de:0030-drops-72173},
doi = {10.4230/LIPIcs.SoCG.2017.44},
annote = {Keywords: hyperbolic surface, Fuchsian group, arithmetic issues, Dehn's algorithm, CGAL}
}
@InProceedings{kattis_et_al:LIPIcs.SoCG.2017.45,
author = {Kattis, Assimakis and Nikolov, Aleksandar},
title = {{Lower Bounds for Differential Privacy from Gaussian Width}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {45:1--45:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.45},
URN = {urn:nbn:de:0030-drops-72368},
doi = {10.4230/LIPIcs.SoCG.2017.45},
annote = {Keywords: differential privacy, convex geometry, lower bounds, sample complexity}
}
@InProceedings{kerber_et_al:LIPIcs.SoCG.2017.46,
author = {Kerber, Michael and Tichy, Robert and Weitzer, Mario},
title = {{Constrained Triangulations, Volumes of Polytopes, and Unit Equations}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {46:1--46:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.46},
URN = {urn:nbn:de:0030-drops-71812},
doi = {10.4230/LIPIcs.SoCG.2017.46},
annote = {Keywords: constrained triangulations, simplotopes, volumes of polytopes, projections of polytopes, unit equations, S-integers}
}
@InProceedings{keszegh_et_al:LIPIcs.SoCG.2017.47,
author = {Keszegh, Bal\'{a}zs and P\'{a}lv\"{o}lgyi, D\"{o}m\"{o}t\"{o}r},
title = {{Proper Coloring of Geometric Hypergraphs}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {47:1--47:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.47},
URN = {urn:nbn:de:0030-drops-71926},
doi = {10.4230/LIPIcs.SoCG.2017.47},
annote = {Keywords: discrete geometry, decomposition of multiple coverings, geometric hypergraph coloring}
}
@InProceedings{kleinhans_et_al:LIPIcs.SoCG.2017.48,
author = {Kleinhans, Maarten and van Kreveld, Marc and Ophelders, Tim and Sonke, Willem and Speckmann, Bettina and Verbeek, Kevin},
title = {{Computing Representative Networks for Braided Rivers}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {48:1--48:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.48},
URN = {urn:nbn:de:0030-drops-72204},
doi = {10.4230/LIPIcs.SoCG.2017.48},
annote = {Keywords: braided rivers, Morse-Smale complex, persistence, network extraction, polyhedral terrain}
}
@InProceedings{lubiw_et_al:LIPIcs.SoCG.2017.49,
author = {Lubiw, Anna and Mas\'{a}rov\'{a}, Zuzana and Wagner, Uli},
title = {{A Proof of the Orbit Conjecture for Flipping Edge-Labelled Triangulations}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {49:1--49:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.49},
URN = {urn:nbn:de:0030-drops-72078},
doi = {10.4230/LIPIcs.SoCG.2017.49},
annote = {Keywords: triangulations, reconfiguration, flip, constrained triangulations, Delaunay triangulation, shellability, piecewise linear balls}
}
@InProceedings{naor:LIPIcs.SoCG.2017.50,
author = {Naor, Assaf},
title = {{A Spectral Gap Precludes Low-Dimensional Embeddings}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {50:1--50:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.50},
URN = {urn:nbn:de:0030-drops-71822},
doi = {10.4230/LIPIcs.SoCG.2017.50},
annote = {Keywords: Metric embeddings, dimensionality reduction, expander graphs, nonlinear spectral gaps, nearest neighbor search, complex interpolation, Markov type.}
}
@InProceedings{oh_et_al:LIPIcs.SoCG.2017.51,
author = {Oh, Eunjin and Ahn, Hee-Kap},
title = {{Dynamic Geodesic Convex Hulls in Dynamic Simple Polygons}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {51:1--51:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.51},
URN = {urn:nbn:de:0030-drops-72198},
doi = {10.4230/LIPIcs.SoCG.2017.51},
annote = {Keywords: Dynamic geodesic convex hull, dynamic simple polygons}
}
@InProceedings{oh_et_al:LIPIcs.SoCG.2017.52,
author = {Oh, Eunjin and Ahn, Hee-Kap},
title = {{Voronoi Diagrams for a Moderate-Sized Point-Set in a Simple Polygon}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {52:1--52:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.52},
URN = {urn:nbn:de:0030-drops-72184},
doi = {10.4230/LIPIcs.SoCG.2017.52},
annote = {Keywords: Simple polygons, Voronoi diagrams, geodesic distance}
}
@InProceedings{parthasarathy_et_al:LIPIcs.SoCG.2017.53,
author = {Parthasarathy, Srinivasan and Sivakoff, David and Tian, Minghao and Wang, Yusu},
title = {{A Quest to Unravel the Metric Structure Behind Perturbed Networks}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {53:1--53:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.53},
URN = {urn:nbn:de:0030-drops-72112},
doi = {10.4230/LIPIcs.SoCG.2017.53},
annote = {Keywords: metric structure, Erd\"{o}s-R\'{e}nyi perturbation, graphs, doubling measure}
}
@InProceedings{pilz_et_al:LIPIcs.SoCG.2017.54,
author = {Pilz, Alexander and Welzl, Emo and Wettstein, Manuel},
title = {{From Crossing-Free Graphs on Wheel Sets to Embracing Simplices and Polytopes with Few Vertices}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {54:1--54:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.54},
URN = {urn:nbn:de:0030-drops-72101},
doi = {10.4230/LIPIcs.SoCG.2017.54},
annote = {Keywords: Geometric Graph, Wheel Set, Simplicial Depth, Gale Transform, Polytope}
}
@InProceedings{rahul:LIPIcs.SoCG.2017.55,
author = {Rahul, Saladi},
title = {{Approximate Range Counting Revisited}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {55:1--55:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.55},
URN = {urn:nbn:de:0030-drops-72354},
doi = {10.4230/LIPIcs.SoCG.2017.55},
annote = {Keywords: orthogonal range searching, rectangle stabbing, colors, approximate count, geometric data structures}
}
@InProceedings{rok_et_al:LIPIcs.SoCG.2017.56,
author = {Rok, Alexandre and Walczak, Bartosz},
title = {{Coloring Curves That Cross a Fixed Curve}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {56:1--56:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.56},
URN = {urn:nbn:de:0030-drops-71788},
doi = {10.4230/LIPIcs.SoCG.2017.56},
annote = {Keywords: String graphs, chi-boundedness, k-quasi-planar graphs}
}
@InProceedings{kerber_et_al:LIPIcs.SoCG.2017.57,
author = {Kerber, Michael and Schreiber, Hannah},
title = {{Barcodes of Towers and a Streaming Algorithm for Persistent Homology}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {57:1--57:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.57},
URN = {urn:nbn:de:0030-drops-71936},
doi = {10.4230/LIPIcs.SoCG.2017.57},
annote = {Keywords: Persistent Homology, Topological Data Analysis, Matrix reduction, Streaming algorithms, Simplicial Approximation}
}
@InProceedings{sidiropoulos_et_al:LIPIcs.SoCG.2017.58,
author = {Sidiropoulos, Anastasios and Sridhar, Vijay},
title = {{Algorithmic Interpretations of Fractal Dimension}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {58:1--58:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.58},
URN = {urn:nbn:de:0030-drops-72126},
doi = {10.4230/LIPIcs.SoCG.2017.58},
annote = {Keywords: fractal dimension, exact algorithms, fixed parameter tractability, approximation schemes, spanners}
}
@InProceedings{pach_et_al:LIPIcs.SoCG.2017.59,
author = {Pach, J\'{a}nos and Tardos, G\'{a}bor and T\'{o}th, G\'{e}za},
title = {{Disjointness Graphs of Segments}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {59:1--59:15},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.59},
URN = {urn:nbn:de:0030-drops-71960},
doi = {10.4230/LIPIcs.SoCG.2017.59},
annote = {Keywords: disjointness graph, chromatic number, clique number, chi-bounded}
}
@InProceedings{wang:LIPIcs.SoCG.2017.60,
author = {Wang, Haitao},
title = {{Bicriteria Rectilinear Shortest Paths among Rectilinear Obstacles in the Plane}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {60:1--60:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.60},
URN = {urn:nbn:de:0030-drops-71876},
doi = {10.4230/LIPIcs.SoCG.2017.60},
annote = {Keywords: rectilinear paths, shortest paths, minimum-link paths, bicriteria paths, rectilinear polygons}
}
@InProceedings{wang:LIPIcs.SoCG.2017.61,
author = {Wang, Haitao},
title = {{Quickest Visibility Queries in Polygonal Domains}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {61:1--61:16},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.61},
URN = {urn:nbn:de:0030-drops-71863},
doi = {10.4230/LIPIcs.SoCG.2017.61},
annote = {Keywords: shortest paths, visibility, quickest visibility queries, shortest path to segments, polygons with holes}
}
@InProceedings{becker_et_al:LIPIcs.SoCG.2017.62,
author = {Becker, Aaron T. and Debboun, Mustapha and Fekete, S\'{a}ndor P. and Krupke, Dominik and Nguyen, An},
title = {{Zapping Zika with a Mosquito-Managing Drone: Computing Optimal Flight Patterns with Minimum Turn Cost}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {62:1--62:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.62},
URN = {urn:nbn:de:0030-drops-72394},
doi = {10.4230/LIPIcs.SoCG.2017.62},
annote = {Keywords: Covering tours, turn cost, complexity, exact optimization}
}
@InProceedings{beekhuis_et_al:LIPIcs.SoCG.2017.63,
author = {Beekhuis, Sander and Buchin, Kevin and Castermans, Thom and Hurks, Thom and Sonke, Willem},
title = {{Ruler of the Plane - Games of Geometry}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {63:1--63:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.63},
URN = {urn:nbn:de:0030-drops-72400},
doi = {10.4230/LIPIcs.SoCG.2017.63},
annote = {Keywords: art gallery problem, ham-sandwich cuts, Voronoi game, traveling sales-person problem}
}
@InProceedings{buchin_et_al:LIPIcs.SoCG.2017.64,
author = {Buchin, Kevin and Chun, Jinhee and L\"{o}ffler, Maarten and Markovic, Aleksandar and Meulemans, Wouter and Okamoto, Yoshio and Shiitada, Taichi},
title = {{Folding Free-Space Diagrams: Computing the Fr\'{e}chet Distance between 1-Dimensional Curves}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {64:1--64:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.64},
URN = {urn:nbn:de:0030-drops-72417},
doi = {10.4230/LIPIcs.SoCG.2017.64},
annote = {Keywords: Frechet distance, ply, k-packed curves}
}
@InProceedings{chen_et_al:LIPIcs.SoCG.2017.65,
author = {Chen, Chao and Metaxas, Dimitris and Wang, Yusu and Wu, Pengxiang},
title = {{Cardiac Trabeculae Segmentation: an Application of Computational Topology}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {65:1--65:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.65},
URN = {urn:nbn:de:0030-drops-72429},
doi = {10.4230/LIPIcs.SoCG.2017.65},
annote = {Keywords: image segmentation, trabeculae, persistent homology, homology localization}
}
@InProceedings{joswig_et_al:LIPIcs.SoCG.2017.66,
author = {Joswig, Michael and Loho, Georg and Lorenz, Benjamin and Raber, Rico},
title = {{MatchTheNet - An Educational Game on 3-Dimensional Polytopes}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {66:1--66:5},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.66},
URN = {urn:nbn:de:0030-drops-72435},
doi = {10.4230/LIPIcs.SoCG.2017.66},
annote = {Keywords: three-dimensional convex polytopes, unfoldings}
}
@InProceedings{nielsen_et_al:LIPIcs.SoCG.2017.67,
author = {Nielsen, Frank and Shao, Laetitia},
title = {{On Balls in a Hilbert Polygonal Geometry}},
booktitle = {33rd International Symposium on Computational Geometry (SoCG 2017)},
pages = {67:1--67:4},
series = {Leibniz International Proceedings in Informatics (LIPIcs)},
ISBN = {978-3-95977-038-5},
ISSN = {1868-8969},
year = {2017},
volume = {77},
editor = {Aronov, Boris and Katz, Matthew J.},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2017.67},
URN = {urn:nbn:de:0030-drops-72443},
doi = {10.4230/LIPIcs.SoCG.2017.67},
annote = {Keywords: Projective geometry, Hilbert geometry, balls}
}
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