论文信息 - Voronoi Diagram for Points in a Simple Polygon

Voronoi Diagram for Points in a Simple Polygon

We present an algorithm for constructing the Voronoi diagram for a set of n points in a simple polygon of m vertices in O(mn + m loglog m + n log n) time and O(m+n) space.

Takao Asano | Tetsuo Asano

[1] Leonidas J. Guibas,et al. Linear time algorithms for visibility and shortest path problems inside simple polygons , 2011, SCG '86.

[2] Leonidas J. Guibas,et al. Optimal Point Location in a Monotone Subdivision , 1986, SIAM J. Comput..

[3] D. T. Lee,et al. Euclidean shortest paths in the presence of rectilinear barriers , 1984, Networks.

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

[5] Robin Sibson,et al. Computing Dirichlet Tessellations in the Plane , 1978, Comput. J..

[6] Michael Ian Shamos,et al. Closest-point problems , 1975, 16th Annual Symposium on Foundations of Computer Science (sfcs 1975).

[7] Robert E. Tarjan,et al. A linear-time algorithm for triangulating simple polygons , 1986, STOC '86.