Point location in Voronoi diagrams of polygons

Given a query point and the Voronoi diagram of a polygon (VD(P)), how to efficiently find the Voronoi region (VR) containing the query point, i.e., the point location in VD(P), is a fundamental operation for many other algorithms based on VD(P), such as path planning, visibility, and so on. A triangulation refinement method for VD(P) is presented in this paper, and then a point-location data structure is provided so that the VR containing the query point can be reported in O(logn) time. The algorithm takes O(n) space and O(nlogn) preprocessing time.

[1]  Leonidas J. Guibas,et al.  Fractional cascading: II. Applications , 1986, Algorithmica.

[2]  David G. Kirkpatrick,et al.  Optimal Search in Planar Subdivisions , 1983, SIAM J. Comput..

[3]  Rui Wang,et al.  Design of a Walkthrough System for Virtual Museum Based on Voronoi Diagram , 2006, 2006 3rd International Symposium on Voronoi Diagrams in Science and Engineering.

[4]  Richard J. Lipton,et al.  Multidimensional Searching Problems , 1976, SIAM J. Comput..

[5]  Robert E. Tarjan,et al.  Planar point location using persistent search trees , 1986, CACM.

[6]  Chenglei Yang,et al.  Voronoi-Based Potentially Visible Set and Visibility Query Algorithms , 2011, 2011 Eighth International Symposium on Voronoi Diagrams in Science and Engineering.