Divide-and-conquer for Voronoi diagrams revisited

Authors:
Oswin Aichholzer;Wolfgang Aigner;Franz Aurenhammer;Thomas Hackl;Bert Jüttler;Elisabeth Pilgerstorfer;Margot Rabl
Affiliations:
Institute for Software Technology, Graz University of Technology, Austria;Institute for Software Technology, Graz University of Technology, Austria;Institute for Theoretical Computer Science, Graz University of Technology, Austria;Institute for Software Technology, Graz University of Technology, Austria;Institute of Applied Geometry, Johannes Kepler University Linz, Austria;Institute of Applied Geometry, Johannes Kepler University Linz, Austria;Institute of Applied Geometry, Johannes Kepler University Linz, Austria
Venue:
Computational Geometry: Theory and Applications
Year:
2010

Citing 18
Cited 3

Randomized incremental construction of abstract Voronoi diagrams

Computational Geometry: Theory and Applications
Approximating smooth planar curves by arc splines

Journal of Computational and Applied Mathematics
Voronoi diagrams based on convex distance functions

SCG '85 Proceedings of the first annual symposium on Computational geometry
Spiral arc spline approximation to a planar spiral

Journal of Computational and Applied Mathematics
VRONI: an engineering approach to the reliable and efficient computation of voronoi diagrams of points and line segments

Computational Geometry: Theory and Applications
Motion Planning in the CL-Environment (Extended Abstract)

WADS '89 Proceedings of the Workshop on Algorithms and Data Structures
The Voronoi Diagram of Curved Objects

Discrete & Computational Geometry
The predicates for the Voronoi diagram of ellipses

Proceedings of the twenty-second annual symposium on Computational geometry
Computation of medial axis and offset curves of curved boundaries in planar domain

Computer-Aided Design
Closest-point problems

SFCS '75 Proceedings of the 16th Annual Symposium on Foundations of Computer Science
Efficient computation of continuous skeletons

SFCS '79 Proceedings of the 20th Annual Symposium on Foundations of Computer Science
A theorem on polygon cutting with applications

SFCS '82 Proceedings of the 23rd Annual Symposium on Foundations of Computer Science
Topology-oriented incremental computation of Voronoi diagrams of circular arcs and straight-line segments

Computer-Aided Design
Medial axis computation for planar free-form shapes

Computer-Aided Design
Divide-and-conquer for Voronoi diagrams revisited

Proceedings of the twenty-fifth annual symposium on Computational geometry
Trimming local and global self-intersections in offset curves/surfaces using distance maps

Computer-Aided Design
Approximating curves and their offsets using biarcs and Pythagorean hodograph quintics

Computer-Aided Design
Medial Axis Transformation of a Planar Shape

IEEE Transactions on Pattern Analysis and Machine Intelligence

Exact medial axis computation for triangulated solids with respect to piecewise linear metrics

Proceedings of the 7th international conference on Curves and Surfaces
Yet another algorithm for generalized Voronoï Diagrams

Proceedings of the 27th Annual ACM Symposium on Applied Computing
Technical note: Voronoi diagrams of algebraic distance fields

Computer-Aided Design

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.