Open Access10.5555/509740.509763
A continuous skeletonization method based on level sets
Martin Rumpf,Alexandru Telea +1 more
- 27 May 2002
- pp 151-157
TL;DR: A robust and efficient method in 2D and 3D for the calculation of skeletons for arbitrary objects is presented, combined with a new indicator to identify the skeleton, which coincides with the singularity set of the distance map.
read more
Abstract: A robust and efficient method in 2D and 3D for the calculation of skeletons for arbitrary objects is presented. The method is based on the calculation of the distance function with respect to the object boundary. This is combined, in a post processing step, with a new indicator to identify the skeleton, which coincides with the singularity set of the distance map. The indicator is defined as a suitable function of certain local momenta of this distance map and allows a robust and accurate computation of the distance from the skeleton set. This distance is then extended, again via the level set method, onto the whole space. Several applications in 2D and 3D are presented.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
3D skeletons: a state-of-the-art report
TL;DR: A taxonomy of 3D skeletons is proposed which allows us to further analyze and compare them with respect to their properties, and describes several applications of3D skeletons, which illustrate their added value for different shape analysis and processing tasks.
•Dissertation
Mesh generation for implicit geometries
Per-Olof Persson,Alan Edelman,Gilbert Strang +2 more
- 01 Jan 2005
TL;DR: The iterative nature of the algorithm makes it particularly useful for moving meshes, and it is shown how to combine it with the level set method for applications in fluid dynamics, shape optimization, and structural deformations.
227
Visual analysis of dimensionality reduction quality for parameterized projections
TL;DR: This work presents a set of interactive visualizations that aim to help users with these tasks by revealing the quality of a projection and thus allowing inspection of parameter choices for DR algorithms, by observing the effects of these choices on the resulting projection.
146
Discrete scale axis representations for 3D geometry
Balint Miklos,Joachim Giesen,Mark Pauly +2 more
- 26 Jul 2010
TL;DR: This paper proposes a spatially adaptive classification of geometric features that yields a robust algorithm for generating medial representations at different levels of abstraction and shows how geometric and topological properties of the continuous setting carry over to discrete shape representations.
Subvoxel precise skeletons of volumetric data based on fast marching methods
TL;DR: This work presents a novel, automatic algorithm for computing subvoxel precise skeletons of volumetric data based on subv Roxel precise distance fields based on a number of fast marching method propagations to extract the skeleton at subv oxel precision.
142
References
A fast marching level set method for monotonically advancing fronts
TL;DR: A fast marching level set method is presented for monotonically advancing fronts, which leads to an extremely fast scheme for solving the Eikonal equation.
3.6K
Building skeleton models via 3-D medial surface/axis thinning algorithms
TL;DR: An efficient three-dimensional (3-D) parallel thinning algorithm for extracting both the medial surfaces and the medial axes of a 3-D object and its use in defect analysis of objects produced by casting and forging is discussed.
1.6K
Related Papers (5)
Mark Foskey,Ming C. Lin,Dinesh Manocha +2 more
- 16 Jun 2003
David Mack Endres,Horacio R. Bouzas +1 more
- 07 Mar 2003