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...
| मुख्य लेखकों: | , , , , , , |
|---|---|
| अन्य लेखक: | |
| स्वरूप: | लेख |
| भाषा: | English |
| प्रकाशित: |
Springer US
2018
|
| ऑनलाइन पहुंच: | http://hdl.handle.net/1721.1/117528 https://orcid.org/0000-0003-3803-5703 |