2002
DOI: 10.1007/3-540-45749-6_36
|View full text |Cite
|
Sign up to set email alerts
|

Approximating the Medial Axis from the Voronoi Diagram with a Convergence Guarantee

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

1
40
0

Year Published

2008
2008
2018
2018

Publication Types

Select...
6
1
1

Relationship

0
8

Authors

Journals

citations
Cited by 33 publications
(41 citation statements)
references
References 14 publications
1
40
0
Order By: Relevance
“…The set Q 2 captures points going to be processed in the next algorithm iteration (detailed further below). Next, we sort the current set Q 1 on increasing ρ (line 15), allowing the second inner loop (lines [17][18][19] to process these in increasing order of their density values. This second loop performs the detection phase of the thinning algorithm.…”
Section: B Algorithmmentioning
confidence: 99%
See 1 more Smart Citation
“…The set Q 2 captures points going to be processed in the next algorithm iteration (detailed further below). Next, we sort the current set Q 1 on increasing ρ (line 15), allowing the second inner loop (lines [17][18][19] to process these in increasing order of their density values. This second loop performs the detection phase of the thinning algorithm.…”
Section: B Algorithmmentioning
confidence: 99%
“…Mesh-based methods use a surface sampling of ∂ Ω, which allows processing higher-resolution shapes. Mesh methods include Voronoi diagrams to compute polygonal skeletons [19]. Amenta et al compute the Power Crust, an approximation of a surface and its medial axis by a subset of Voronoi points [2].…”
Section: Introductionmentioning
confidence: 99%
“…Once a suitable molecular surface is extracted, we compute its medial axis using the algorithm in (Dey and Zhao, 2004). Medial axis is usually very noisy and often does not prove to be a very useful and robust descriptor of the shape under investigation.…”
Section: Secondary Structure Detectionmentioning
confidence: 99%
“…Variants of the topological structures of this function have been used earlier for shape modeling of three dimensional objects. In computational geometry, the distance function has been used to reconstruct piecewise triangulated surfaces from discrete point samples (Chaine, 2003; Giesen and John, 2003) and to compute the stable medial axis (Chazal and Lieutier, 2004; Siddiqi et al, 1998; Dey and Zhao, 2004). While a surface approximation and its medial axis serve as crude shape descriptors, deeper insights about the feature space of the shape can also be obtained using the critical points of the distance function.…”
Section: Introductionmentioning
confidence: 99%
“…Several MA regularization techniques have been independently developed but rather share common ideas and mainly vary in how the MA elements are selected to prune. We briefly review them and for in-depth surveys, see [2,32,10,26,34].…”
Section: Related Workmentioning
confidence: 99%