Published in: LIPIcs, Volume 258, 39th International Symposium on Computational Geometry (SoCG 2023)
Evanthia Papadopoulou. Abstract Voronoi-Like Graphs: Extending Delaunay’s Theorem and Applications. In 39th International Symposium on Computational Geometry (SoCG 2023). Leibniz International Proceedings in Informatics (LIPIcs), Volume 258, pp. 52:1-52:16, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2023)
@InProceedings{papadopoulou:LIPIcs.SoCG.2023.52, author = {Papadopoulou, Evanthia}, title = {{Abstract Voronoi-Like Graphs: Extending Delaunay’s Theorem and Applications}}, booktitle = {39th International Symposium on Computational Geometry (SoCG 2023)}, pages = {52:1--52:16}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-273-0}, ISSN = {1868-8969}, year = {2023}, volume = {258}, editor = {Chambers, Erin W. and Gudmundsson, Joachim}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.SoCG.2023.52}, URN = {urn:nbn:de:0030-drops-179024}, doi = {10.4230/LIPIcs.SoCG.2023.52}, annote = {Keywords: Voronoi-like graph, abstract Voronoi diagram, Delaunay’s theorem, Voronoi tree, linear-time randomized algorithm, constraint Delaunay triangulation} }
Published in: LIPIcs, Volume 212, 32nd International Symposium on Algorithms and Computation (ISAAC 2021)
Franz Aurenhammer, Evanthia Papadopoulou, and Martin Suderland. Piecewise-Linear Farthest-Site Voronoi Diagrams. In 32nd International Symposium on Algorithms and Computation (ISAAC 2021). Leibniz International Proceedings in Informatics (LIPIcs), Volume 212, pp. 30:1-30:11, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2021)
@InProceedings{aurenhammer_et_al:LIPIcs.ISAAC.2021.30, author = {Aurenhammer, Franz and Papadopoulou, Evanthia and Suderland, Martin}, title = {{Piecewise-Linear Farthest-Site Voronoi Diagrams}}, booktitle = {32nd International Symposium on Algorithms and Computation (ISAAC 2021)}, pages = {30:1--30:11}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-214-3}, ISSN = {1868-8969}, year = {2021}, volume = {212}, editor = {Ahn, Hee-Kap and Sadakane, Kunihiko}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2021.30}, URN = {urn:nbn:de:0030-drops-154633}, doi = {10.4230/LIPIcs.ISAAC.2021.30}, annote = {Keywords: Voronoi diagram, farthest-site, polyhedral distance, polyhedral sites, general dimensions} }
Published in: LIPIcs, Volume 123, 29th International Symposium on Algorithms and Computation (ISAAC 2018)
Franz Aurenhammer, Michael Steinkogler, and Rolf Klein. Partially Walking a Polygon. In 29th International Symposium on Algorithms and Computation (ISAAC 2018). Leibniz International Proceedings in Informatics (LIPIcs), Volume 123, pp. 60:1-60:9, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2018)
@InProceedings{aurenhammer_et_al:LIPIcs.ISAAC.2018.60, author = {Aurenhammer, Franz and Steinkogler, Michael and Klein, Rolf}, title = {{Partially Walking a Polygon}}, booktitle = {29th International Symposium on Algorithms and Computation (ISAAC 2018)}, pages = {60:1--60:9}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-094-1}, ISSN = {1868-8969}, year = {2018}, volume = {123}, editor = {Hsu, Wen-Lian and Lee, Der-Tsai and Liao, Chung-Shou}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2018.60}, URN = {urn:nbn:de:0030-drops-100089}, doi = {10.4230/LIPIcs.ISAAC.2018.60}, annote = {Keywords: Polygon, guard walk, visibility} }
Published in: LIPIcs, Volume 92, 28th International Symposium on Algorithms and Computation (ISAAC 2017)
Franz Aurenhammer, Bert Jüttler, and Günter Paulini. Voronoi Diagrams for Parallel Halflines and Line Segments in Space. In 28th International Symposium on Algorithms and Computation (ISAAC 2017). Leibniz International Proceedings in Informatics (LIPIcs), Volume 92, pp. 7:1-7:10, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)
@InProceedings{aurenhammer_et_al:LIPIcs.ISAAC.2017.7, author = {Aurenhammer, Franz and J\"{u}ttler, Bert and Paulini, G\"{u}nter}, title = {{Voronoi Diagrams for Parallel Halflines and Line Segments in Space}}, booktitle = {28th International Symposium on Algorithms and Computation (ISAAC 2017)}, pages = {7:1--7:10}, series = {Leibniz International Proceedings in Informatics (LIPIcs)}, ISBN = {978-3-95977-054-5}, ISSN = {1868-8969}, year = {2017}, volume = {92}, editor = {Okamoto, Yoshio and Tokuyama, Takeshi}, publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik}, address = {Dagstuhl, Germany}, URL = {https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ISAAC.2017.7}, URN = {urn:nbn:de:0030-drops-82157}, doi = {10.4230/LIPIcs.ISAAC.2017.7}, annote = {Keywords: Voronoi diagram, line segments, space-sweep algorithm} }
Feedback for Dagstuhl Publishing