Improved dynamic geodesic nearest neighbor searching in a simple polygon

Research output: Contribution to book/anthology/report/proceedingArticle in proceedingsResearchpeer-review

Documents

DOI

    Pankaj K. Agarwal, Duke University,
  • Lars Arge
  • Frank Staals, Utrecht University, Utrecht
Original languageEnglish
Title of host publication34th International Symposium on Computational Geometry, SoCG 2018
EditorsCsaba D. Toth, Bettina Speckmann
Number of pages14
Volume99
PublisherSchloss Dagstuhl- Leibniz-Zentrum fur Informatik GmbH, Dagstuhl Publishing
Publication year2018
Pages4:1-4:14
ISBN (Electronic)9783959770668
DOIs
Publication statusPublished - 2018
Event34th International Symposium on Computational Geometry, SoCG 2018 - Budapest, Hungary
Duration: 11 Jun 201814 Jun 2018

Conference

Conference34th International Symposium on Computational Geometry, SoCG 2018
LandHungary
ByBudapest
Periode11/06/201814/06/2018
SeriesLeibniz International Proceedings in Informatics
Volume99
ISSN1868-8969

    Research areas

  • Data structure, Geodesic distance, Nearest neighbor searching, Shallow cutting, Simple polygon

See relations at Aarhus University Citationformats

ID: 134883030