Abstract
We address the problem of replicating a Voronoi diagram V(S) of a planar point set S by making proximity queries: 1. the exact location of the nearest site(s) in S 2. the distance to and label(s) of the nearest site(s) in S 3. a unique label for every nearest site in S. In addition to showing the limits of nearest-neighbor database security, our methods also provide one of the first natural algorithmic applications of retroactive data structures. © 2010 Springer-Verlag.
Cite
CITATION STYLE
Dickerson, M. T., Eppstein, D., & Goodrich, M. T. (2010). Cloning Voronoi diagrams via retroactive data structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 6346 LNCS, pp. 362–373). https://doi.org/10.1007/978-3-642-15775-2_31
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
