The Voronoi Diagram of Curved Objects

Voronoi diagrams of curved objects can show certain phenomena that are often considered artifacts: The Voronoi diagram is not connected; there are pairs of objects whose bisector is a closed curve or even a two-dimensional object; there are Voronoi edges between different parts of the same site (so-called self-Voronoi-edges); these self-Voronoi-edges may end at seemingly arbitrary points not on a site, and, in the case of a circular site, even degenerate to a single isolated point. We give a systematic study of these phenomena, characterizing their differential-geometric and topological properties. We show how a given set of curves can be refined such that the resulting curves define a “well-behaved” Voronoi diagram. We also give a randomized incremental algorithm to compute this diagram. The expected running time of this algorithm is O(n log n).

[1]  Chee-Keng Yap,et al.  AnO(n logn) algorithm for the voronoi diagram of a set of simple curve segments , 1987, Discret. Comput. Geom..

[2]  Wolfgang Vogt,et al.  Über monotongekrümmte Kurven. , 2022 .

[3]  R. Seidel Backwards Analysis of Randomized Geometric Algorithms , 1993 .

[4]  Michael Ian Shamos,et al.  Computational geometry: an introduction , 1985 .

[5]  Chee-Keng Yap,et al.  A "Retraction" Method for Planning the Motion of a Disc , 1985, J. Algorithms.

[6]  Mariette Yvinec,et al.  Applications of random sampling to on-line algorithms in computational geometry , 1992, Discret. Comput. Geom..

[7]  L. Chew Building Voronoi Diagrams for Convex Polygons in Linear Expected Time , 1990 .

[8]  Helmut Alt,et al.  Motion Planning in the CL-Environment (Extended Abstract) , 1989, WADS.

[9]  Kurt Mehlhorn,et al.  Randomized Incremental Construction of Abstract Voronoi Diagrams , 1993, Comput. Geom..

[10]  Franz Aurenhammer,et al.  Voronoi diagrams—a survey of a fundamental geometric data structure , 1991, CSUR.

[11]  Rolf Klein,et al.  Abstract Voronoi Diagrams and their Applications , 1988, Workshop on Computational Geometry.

[12]  Derick Wood,et al.  Voronoi Diagrams Based on General Metrics in the Plane , 1988, STACS.

[13]  Atsuyuki Okabe,et al.  Spatial Tessellations: Concepts and Applications of Voronoi Diagrams , 1992, Wiley Series in Probability and Mathematical Statistics.

[14]  Kenneth L. Clarkson,et al.  Applications of random sampling in computational geometry, II , 1988, SCG '88.

[15]  David E. Muller,et al.  Finding the Intersection of two Convex Polyhedra , 1978, Theor. Comput. Sci..

[16]  Micha Sharir,et al.  Planning a purely translational motion for a convex object in two-dimensional space using generalized Voronoi diagrams , 2016, Discret. Comput. Geom..

[17]  Rolf Klein,et al.  Concrete and Abstract Voronoi Diagrams , 1990, Lecture Notes in Computer Science.

[18]  Ketan Mulmuley A Fast Planar Partition Algorithm, I , 1990, J. Symb. Comput..

[19]  Jin J. Chou Voronoi diagrams for planar shapes , 1995, IEEE Computer Graphics and Applications.