论文信息 - On the Peeper's Voronoi diagram

On the Peeper's Voronoi diagram

In the peeper's Voronoi diagram for n sites, any point in the plane belongs to the region of the closest site visible from it. Visibility is constrained to a segment on a line avoiding the convex hull of the sites. We show that the peeper's Voronoi diagram attains a size of Θ(n2) in the worst case, and that it can be computed in O(n2)time and space.

F. Aurenhammer | G. Stöckl

[1] Boris Aronov. On the geodesic Voronoi diagram of point sites in a simple polygon , 1987, SCG '87.

[2] Micha Sharir,et al. The upper envelope of piecewise linear functions and the boundary of a region enclosed by convex plates: Combinatorial analysis , 2011, Discret. Comput. Geom..

[3] Lenhart K. Schubert,et al. An optimal algorithm for constructing the Delaunay triangulation of a set of line segments , 1987, SCG '87.

[4] Micha Sharir,et al. On the shortest paths between two convex polyhedra , 2018, JACM.

[5] D. T. Lee,et al. Generalization of Voronoi Diagrams in the Plane , 1981, SIAM J. Comput..

[6] Jon Louis Bentley,et al. Multidimensional divide-and-conquer , 1980, CACM.

[7] Franz Aurenhammer,et al. Power Diagrams: Properties, Algorithms and Applications , 1987, SIAM J. Comput..

[8] Raimund Seidel,et al. Voronoi diagrams and arrangements , 1986, Discret. Comput. Geom..

[9] Leonidas J. Guibas,et al. The upper envelope of piecewise linear functions: Algorithms and applications , 2015, Discret. Comput. Geom..

[10] Bernard Chazelle,et al. A Functional Approach to Data Structures and Its Use in Multidimensional Searching , 1988, SIAM J. Comput..

[11] John Hershberger,et al. Finding the Upper Envelope of n Line Segments in O(n log n) Time , 1989, Inf. Process. Lett..