Efficient and Robust Computation of an Approximated Medial Axis

This result is then used to bound the distance d I between two point cloud samples of a given metric space, thereby leading to the bound for (a quantity related to) d I (N X,n (r,s)

Given that the inner Voronoi subset V is connected and the boundary is water tight it is easy to verify that all the inner volume is covered by the set of tetrahedra and pyramids,

Theorem 4.1 Let ε 0 be such that 10ε λ. Proof From now on, one fixes a real ε 0 and an open set ˜ satisfying the hypothesis of the theorem.. Some quite long com- putations show

Figure 7: (a) Limb vertices, (b) connected component of the limb vertices with two boundary components, and medial loop (marked curve), (c) medial sphere centred in the barycentre

The function is based on the geodesic dis- tances between points where the maximal balls defining the medial axis touch the shape boundary.. We call it the medial

We generalized the well-known definition of medial surfaces (in 3D) or medial axes (in 2D) to define curve skeletons as the loci of points on the medial surface situated at

Computation in Projective Space – the nearest point Find the nearest point on an intersection of two planes to the given point ξ.

Computation in Projective Space – the nearest point Find the nearest point on an intersection of two planes to the given point ξ.