-
Distance Function: Every point in three-dimension
is assigned its distance to the shape.
-
When the shape is known only via a finite point
sample, the critical points can be detected by Voronoi-Delaunay
duality.

-
Direction of Steepest Ascent of the Distance
Function can be determined combinatorially.
-
For U2, a polyline
is traced from an index 2 saddle point following that direction.
|
|
-
For U1, a polygonal patch is iteratively
constructed starting from the Voronoi facet
containing the index 1 saddle point.

- Medial Axis
Classification and Skeletonization

-
Annotation
of Feature into Flat and Tubular parts
