Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams
Name
453_2017_389_ReferencePDF.pdf
Size
304.67 KB
Format
Adobe PDF
Checksum (MD5)
92c1d2b487ee97caa62de00803704cb9
Author(s)
Aronov, Boris
Bose, Prosenjit
Gudmundsson, Joachim
Iacono, John
Langerman, Stefan
Smid, Michiel
Demaine, Erik D
Date Issued
November 2017
Journal
Algorithmica
Publisher
Springer US
Citation
Aronov, Boris, et al. “Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams.” Algorithmica, vol. 80, no. 11, Nov. 2018, pp. 3316–34.
Version
Author's final manuscript
Abstract
We consider preprocessing a set S of n points in convex position in the plane into a data structure supporting queries of the following form: given a point q and a directed line ℓ in the plane, report the point of S that is farthest from (or, alternatively, nearest to) the point q among all points to the left of line ℓ. We present two data structures for this problem. The first data structure uses O(n[superscript 1+ε]) space and preprocessing time, and answers queries in O(2[superscript 1/ε]logn) time, for any 0<ε<1. The second data structure uses O(nlog[superscript 3]n) space and polynomial preprocessing time, and answers queries in O(logn) time. These are the first solutions to the problem with O(logn) query time and o(n2) space. The second data structure uses a new representation of nearest- and farthest-point Voronoi diagrams of points in convex position. This representation supports the insertion of new points in clockwise order using only O(logn) amortized pointer changes, in addition to O(logn) -time point-location queries, even though every such update may make Θ(n) combinatorial changes to the Voronoi diagram. This data structure is the first demonstration that deterministically and incrementally constructed Voronoi diagrams can be maintained in o(n) amortized pointer changes per operation while keeping O(logn) -time point-location queries. Keywords: Voronoi diagrams, Data structures, Trees, Flarbs
MIT Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike
Persistent DSpace Link
DOI of Published Version
https://doi.org/10.1007/s00453-017-0389-y
