An Efficiently Computable Metric for Comparing Polygonal Shapes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Continuous skeleton computation by Voronoi diagram
CVGIP: Image Understanding
The crust and the &Bgr;-Skeleton: combinatorial curve reconstruction
Graphical Models and Image Processing
Polygon decomposition based on the straight line skeleton
Proceedings of the nineteenth annual symposium on Computational geometry
Complexity of the delaunay triangulation of points on surfaces the smooth case
Proceedings of the nineteenth annual symposium on Computational geometry
Matching 3D Models with Shape Distributions
SMI '01 Proceedings of the International Conference on Shape Modeling & Applications
Hi-index | 0.00 |
Recent results establish that a subset of the Voronoi diagram of a point set that is sampled from the smooth boundary of a shape approximates the medial axis. The corresponding question for the dual Delaunay triangulation is not addressed in the literature. We show that, for two-dimensional shapes, the Delaunay triangulation approximates a specific structure which we call anchor hulls. As an application we demonstrate that our approximation result is useful for the problem of shape matching.