LIPIcs, Volume 34
SoCG 2015, June 22-25, 2015, Eindhoven, The Netherlands
Editors: Lars Arge and János Pach
Published in: LIPIcs, Volume 162, 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)
Lars Arge, Mathias Rav, Morten Revsbæk, Yujin Shin, and Jungwoo Yang. Sea-Rise Flooding on Massive Dynamic Terrains. In 17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020). Leibniz International Proceedings in Informatics (LIPIcs), Volume 162, pp. 6:1-6:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2020)
@InProceedings{arge_et_al:LIPIcs.SWAT.2020.6, author = {Arge, Lars and Rav, Mathias and Revsb{\ae}k, Morten and Shin, Yujin and Yang, Jungwoo}, title = {{Sea-Rise Flooding on Massive Dynamic Terrains}}, booktitle = {17th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2020)}, pages = {6:1--6:19}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-150-4}, ISSN = {1868-8969}, year = {2020}, volume = {162}, editor = {Albers, Susanne}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SWAT.2020.6}, URN = {urn:nbn:de:0030-drops-122539}, doi = {10.4230/LIPIcs.SWAT.2020.6}, annote = {Keywords: Computational geometry, I/O-algorithms, merge tree, dynamic terrain} }
Published in: LIPIcs, Volume 99, 34th International Symposium on Computational Geometry (SoCG 2018)
Pankaj K. Agarwal, Lars Arge, and Frank Staals. Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon. In 34th International Symposium on Computational Geometry (SoCG 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 99, pp. 4:1-4:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
@InProceedings{agarwal_et_al:LIPIcs.SoCG.2018.4, author = {Agarwal, Pankaj K. and Arge, Lars and Staals, Frank}, title = {{Improved Dynamic Geodesic Nearest Neighbor Searching in a Simple Polygon}}, booktitle = {34th International Symposium on Computational Geometry (SoCG 2018)}, pages = {4:1--4:14}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-066-8}, ISSN = {1868-8969}, year = {2018}, volume = {99}, editor = {Speckmann, Bettina and T\'{o}th, Csaba D.}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2018.4}, URN = {urn:nbn:de:0030-drops-87175}, doi = {10.4230/LIPIcs.SoCG.2018.4}, annote = {Keywords: data structure, simple polygon, geodesic distance, nearest neighbor searching, shallow cutting} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@Proceedings{arge_et_al:LIPIcs.SOCG.2015, title = {{LIPIcs, Volume 34, SoCG'15, Complete Volume}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015}, URN = {urn:nbn:de:0030-drops-52479}, doi = {10.4230/LIPIcs.SOCG.2015}, annote = {Keywords: Analysis of Algorithms and Problem Complexity, Nonnumerical Algorithms and Problems – Geometrical problems and computations, Discrete Mathematics} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. i-xx, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{arge_et_al:LIPIcs.SOCG.2015.i, author = {Arge, Lars and Pach, J\'{a}nos}, title = {{Front Matter, Table of Contents, Preface, Conference Organization}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {i--xx}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.i}, URN = {urn:nbn:de:0030-drops-50844}, doi = {10.4230/LIPIcs.SOCG.2015.i}, annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Jirí Matoušek and Aleksandar Nikolov. Combinatorial Discrepancy for Boxes via the gamma_2 Norm. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{matousek_et_al:LIPIcs.SOCG.2015.1, author = {Matou\v{s}ek, Jir{\'\i} and Nikolov, Aleksandar}, title = {{Combinatorial Discrepancy for Boxes via the gamma\underline2 Norm}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {1--15}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.1}, URN = {urn:nbn:de:0030-drops-51091}, doi = {10.4230/LIPIcs.SOCG.2015.1}, annote = {Keywords: discrepancy theory, range counting, factorization norms} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Aaron T. Becker, Erik D. Demaine, Sándor P. Fekete, Hamed Mohtasham Shad, and Rose Morris-Wright. Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 16-18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{becker_et_al:LIPIcs.SOCG.2015.16, author = {Becker, Aaron T. and Demaine, Erik D. and Fekete, S\'{a}ndor P. and Shad, Hamed Mohtasham and Morris-Wright, Rose}, title = {{Tilt: The Video - Designing Worlds to Control Robot Swarms with Only Global Signals}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {16--18}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.16}, URN = {urn:nbn:de:0030-drops-50870}, doi = {10.4230/LIPIcs.SOCG.2015.16}, annote = {Keywords: Particle swarms, global control, complexity, geometric computation} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Gill Barequet and Mira Shalah. Automatic Proofs for Formulae Enumerating Proper Polycubes. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 19-22, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{barequet_et_al:LIPIcs.SOCG.2015.19, author = {Barequet, Gill and Shalah, Mira}, title = {{Automatic Proofs for Formulae Enumerating Proper Polycubes}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {19--22}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.19}, URN = {urn:nbn:de:0030-drops-50889}, doi = {10.4230/LIPIcs.SOCG.2015.19}, annote = {Keywords: Polycubes, inclusion-exclusion} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Nicholas J. Cavanna, Mahmoodreza Jahanseir, and Donald R. Sheehy. Visualizing Sparse Filtrations. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 23-25, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{cavanna_et_al:LIPIcs.SOCG.2015.23, author = {Cavanna, Nicholas J. and Jahanseir, Mahmoodreza and Sheehy, Donald R.}, title = {{Visualizing Sparse Filtrations}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {23--25}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.23}, URN = {urn:nbn:de:0030-drops-50893}, doi = {10.4230/LIPIcs.SOCG.2015.23}, annote = {Keywords: Topological Data Analysis, Simplicial Complexes, Persistent Homology} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Topi Talvitie. Visualizing Quickest Visibility Maps. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 26-28, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{talvitie:LIPIcs.SOCG.2015.26, author = {Talvitie, Topi}, title = {{Visualizing Quickest Visibility Maps}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {26--28}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.26}, URN = {urn:nbn:de:0030-drops-50906}, doi = {10.4230/LIPIcs.SOCG.2015.26}, annote = {Keywords: path planning, visibility} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Zeev Dvir and Guangda Hu. Sylvester-Gallai for Arrangements of Subspaces. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 29-43, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{dvir_et_al:LIPIcs.SOCG.2015.29, author = {Dvir, Zeev and Hu, Guangda}, title = {{Sylvester-Gallai for Arrangements of Subspaces}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {29--43}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.29}, URN = {urn:nbn:de:0030-drops-51303}, doi = {10.4230/LIPIcs.SOCG.2015.29}, annote = {Keywords: Sylvester-Gallai, Locally Correctable Codes} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Wolfgang Mulzer and Yannik Stein. Computational Aspects of the Colorful Carathéodory Theorem. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 44-58, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{mulzer_et_al:LIPIcs.SOCG.2015.44, author = {Mulzer, Wolfgang and Stein, Yannik}, title = {{Computational Aspects of the Colorful Carath\'{e}odory Theorem}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {44--58}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.44}, URN = {urn:nbn:de:0030-drops-51019}, doi = {10.4230/LIPIcs.SOCG.2015.44}, annote = {Keywords: colorful Carath\'{e}odory theorem, high-dimensional approximation, PLS} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Andrew Suk. Semi-algebraic Ramsey Numbers. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 59-73, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{suk:LIPIcs.SOCG.2015.59, author = {Suk, Andrew}, title = {{Semi-algebraic Ramsey Numbers}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {59--73}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.59}, URN = {urn:nbn:de:0030-drops-50955}, doi = {10.4230/LIPIcs.SOCG.2015.59}, annote = {Keywords: Ramsey theory, semi-algebraic relation, one-sided hyperplanes, Schur numbers} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Oliver Roche-Newton. A Short Proof of a Near-Optimal Cardinality Estimate for the Product of a Sum Set. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 74-80, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{rochenewton:LIPIcs.SOCG.2015.74, author = {Roche-Newton, Oliver}, title = {{A Short Proof of a Near-Optimal Cardinality Estimate for the Product of a Sum Set}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {74--80}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.74}, URN = {urn:nbn:de:0030-drops-51200}, doi = {10.4230/LIPIcs.SOCG.2015.74}, annote = {Keywords: Szemer\'{e}di-Trotter Theorem, pinned distances, sum-product estimates} }
Published in: LIPIcs, Volume 34, 31st International Symposium on Computational Geometry (SoCG 2015)
Menelaos I. Karavelas and Eleni Tzanaki. A Geometric Approach for the Upper Bound Theorem for Minkowski Sums of Convex Polytopes. In 31st International Symposium on Computational Geometry (SoCG 2015). Leibniz International Proceedings in Informatics (LIPIcs), Volume 34, pp. 81-95, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2015)
@InProceedings{karavelas_et_al:LIPIcs.SOCG.2015.81, author = {Karavelas, Menelaos I. and Tzanaki, Eleni}, title = {{A Geometric Approach for the Upper Bound Theorem for Minkowski Sums of Convex Polytopes}}, booktitle = {31st International Symposium on Computational Geometry (SoCG 2015)}, pages = {81--95}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-939897-83-5}, ISSN = {1868-8969}, year = {2015}, volume = {34}, editor = {Arge, Lars and Pach, J\'{a}nos}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops-dev.dagstuhl.de/entities/document/10.4230/LIPIcs.SOCG.2015.81}, URN = {urn:nbn:de:0030-drops-51428}, doi = {10.4230/LIPIcs.SOCG.2015.81}, annote = {Keywords: Convex polytopes, Minkowski sum, upper bound} }
Feedback for Dagstuhl Publishing