Math @ Duke

Publications [#336323] of Pankaj K. Agarwal
Papers Published
 Agarwal, PK; Arge, L; Staals, F, Improved dynamic geodesic nearest neighbor searching in a simple polygon,
Leibniz International Proceedings in Informatics, Lipics, vol. 99
(June, 2018),
pp. 41414 [doi]
(last updated on 2019/02/22)
Abstract: © Pankaj K. Agarwal, Lars Arge, and Frank Staals; licensed under Creative Commons License CCBY 34th Symposium on Computational Geometry (SoCG 2018). We present an efficient dynamic data structure that supports geodesic nearest neighbor queries for a set S of point sites in a static simple polygon P. Our data structure allows us to insert a new site in S, delete a site from S, and ask for the site in S closest to an arbitrary query point q ∈ P. All distances are measured using the geodesic distance, that is, the length of the shortest path that is completely contained in P. Our data structure achieves polylogarithmic update and query times, and uses O(n log3nlog m + m) space, where n is the number of sites in S and m is the number of vertices in P. The crucial ingredient in our data structure is an implicit representation of a vertical shallow cutting of the geodesic distance functions. We show that such an implicit representation exists, and that we can compute it efficiently.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

