Divide-and-conquer for Voronoi diagrams revisited

We show how to divide the edge graph of a Voronoi diagram into a tree that corresponds to the medial axis of an (augmented) planar domain. Division into base cases is then possible, which, in the bottom-up phase, can be merged by trivial concatenation. The resulting construction algorithm-similar to Delaunay triangulation methods-is not bisector-based and merely computes dual links between the sites, its atomic steps being inclusion tests for sites in circles. This guarantees computational simplicity and numerical stability. Moreover, no part of the Voronoi diagram, once constructed, has to be discarded again. The algorithm works for polygonal and curved objects as sites and, in particular, for circular arcs, which allows its extension to general free-form objects by Voronoi diagram preserving and data saving biarc approximations. The algorithm is randomized, with expected runtime O(nlogn) under certain assumptions on the input data. Experiments substantiate an efficient behavior even when these assumptions are not met. Applications to offset computations and motion planning for general objects are described.

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

[2]  Ioannis Z. Emiris,et al.  The predicates for the Voronoi diagram of ellipses , 2006, SCG '06.

[3]  Otfried Cheong,et al.  The Voronoi Diagram of Curved Objects , 1995, SCG '95.

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

[5]  Martin Held,et al.  VRONI: An engineering approach to the reliable and efficient computation of Voronoi diagrams of points and line segments , 2001, Comput. Geom..

[6]  Bert Jüttler,et al.  Approximating curves and their offsets using biarcs and Pythagorean hodograph quintics , 2006, Comput. Aided Des..

[7]  Jian Liu,et al.  Computation of medial axis and offset curves of curved boundaries in planar domain , 2008, Comput. Aided Des..

[8]  Franz Aurenhammer,et al.  Computational and Structural Advantages of Circular Boundary Representation , 2007, Int. J. Comput. Geom. Appl..

[9]  Chee Yap,et al.  Motion planning in the CL-environment: A case for a realistic model (invited talk) , 1989 .

[10]  Kurt Mehlhorn,et al.  Randomized construction diagrams* incremental of abstract Voronoi , 1993 .

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

[12]  Erwin Kreyszig,et al.  Differential geometry , 1991 .

[13]  Otfried Cheong,et al.  The Voronoi Diagram of Curved Objects , 2005, Discret. Comput. Geom..

[14]  Martin Held,et al.  Voronoi diagrams and offset curves of curvilinear polygons , 1998, Comput. Aided Des..

[15]  Gershon Elber,et al.  MATHSM: medial axis transform toward high speed machining of pockets , 2005, Comput. Aided Des..

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

[17]  Hwan Pyo Moon,et al.  MATHEMATICAL THEORY OF MEDIAL AXIS TRANSFORM , 1997 .

[18]  David G. Kirkpatrick,et al.  A compact piecewise-linear voronoi diagram for convex sites in the plane , 1996, Discret. Comput. Geom..

[19]  D. Walton,et al.  Spiral arc spline approximation to a planar spiral , 1999 .

[20]  Francis Y. L. Chin,et al.  Finding the Medial Axis of a Simple Polygon in Linear Time , 1995, ISAAC.

[21]  Robert L. Scot Drysdale,et al.  Voronoi diagrams based on convex distance functions , 1985, SCG '85.

[22]  Gábor Lukács,et al.  Pocket machining based on contour-parallel tool paths generated by means of proximity maps , 1994, Comput. Aided Des..

[23]  Gershon Elber,et al.  Trimming local and global self-intersections in offset curves/surfaces using distance maps , 2006, Comput. Aided Des..

[24]  Martin Held,et al.  Author's Personal Copy Computer-aided Design Topology-oriented Incremental Computation of Voronoi Diagrams of Circular Arcs and Straight-line Segments , 2022 .

[25]  D. T. Lee,et al.  Medial Axis Transformation of a Planar Shape , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[26]  D. Walton,et al.  Approximating smooth planar curves by arc splines , 1995 .

[27]  Franz Aurenhammer,et al.  Medial axis computation for planar free-form shapes , 2009, Comput. Aided Des..

[28]  Pierre Alliez,et al.  Computational geometry algorithms library , 2008, SIGGRAPH '08.

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

[30]  David G. Kirkpatrick,et al.  Efficient computation of continuous skeletons , 1979, 20th Annual Symposium on Foundations of Computer Science (sfcs 1979).

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

[32]  Bernard Chazelle,et al.  A theorem on polygon cutting with applications , 1982, 23rd Annual Symposium on Foundations of Computer Science (sfcs 1982).

[33]  Steven Fortune,et al.  A sweepline algorithm for Voronoi diagrams , 1986, SCG '86.

[34]  Micha Sharir,et al.  Intersection and Closest-Pair Problems for a Set of Planar Discs , 1985, SIAM J. Comput..