Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams

Data Structures for Halfplane Proximity Queries and Incremental Voronoi Diagrams

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 t...

Full description

Bibliographic Details
Main Authors: Aronov, Boris, Bose, Prosenjit, Gudmundsson, Joachim, Iacono, John, Langerman, Stefan, Smid, Michiel, Demaine, Erik D
Other Authors: Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Format: Article
Language:English
Published: Springer US 2018
Online Access:http://hdl.handle.net/1721.1/117528
https://orcid.org/0000-0003-3803-5703

Internet

http://hdl.handle.net/1721.1/117528
https://orcid.org/0000-0003-3803-5703

Similar Items