Computational geometry: an introduction
Computational geometry: an introduction
Voronoi diagram for multiply-connected polygonal domains 1: algorithm
IBM Journal of Research and Development
Computer Aided Geometric Design - Special issue: Topics in CAGD
The Euclidean distance transform
The Euclidean distance transform
The bisector of a point and a plane parametric curve
Computer Aided Geometric Design
Voronoi Diagrams of Set-Theoretic solid Models
IEEE Computer Graphics and Applications
Symmetry Maps of Free-Form Curve Segments via Wave Propagation
International Journal of Computer Vision - Special Issue on Computational Vision at Brown University
Precise Voronoi cell extraction of free-form rational planar closed curves
Proceedings of the 2005 ACM symposium on Solid and physical modeling
Voronoi diagram computations for planar NURBS curves
Proceedings of the 2008 ACM symposium on Solid and physical modeling
Approximations of 2D and 3D generalized Voronoi diagrams
International Journal of Computer Mathematics
Medial axis computation for planar free-form shapes
Computer-Aided Design
2009 SIAM/ACM Joint Conference on Geometric and Physical Modeling
Distance functions and skeletal representations of rigid and non-rigid planar shapes
Computer-Aided Design
Medial axis of a planar region by offset self-intersections
Computer-Aided Design
Interior Medial Axis Transform computation of 3D objects bound by free-form surfaces
Computer-Aided Design
Tracking point-curve critical distances
GMP'06 Proceedings of the 4th international conference on Geometric Modeling and Processing
Minimum area enclosure and alpha hull of a set of freeform planar closed curves
Computer-Aided Design
| Hi-index | 0.00 |
Algorithms computing the Voronoi diagrams for polygons abound in literature; however, few practical algorithms are available to date for shapes bounded by arbitrary closed curves. This paper presents some properties for the diagrams and an algorithm to compute the diagrams for simply connected planar shapes. The algorithm traces the diagram out directly, starting from a few points. During the tracing, extraneous portions of prior traces are trimmed. When all the start points are traced, the diagram is complete. The tracing is based on the differential properties of the diagrams and can be done as accurately as desired without explicitly discretizing the curves.