Proceedings. International Conference on Image Processing
DOI: 10.1109/icip.2002.1038958
|View full text |Cite
|
Sign up to set email alerts
|

Simple and efficient algorithm for part decomposition of 3-D triangulated models based on curvature analysis

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
34
0
1

Publication Types

Select...
4
2
1

Relationship

0
7

Authors

Journals

citations
Cited by 49 publications
(35 citation statements)
references
References 9 publications
0
34
0
1
Order By: Relevance
“…From all algorithms, the most popular are those that use the minima-rule to segment the mesh. Therefore the measure of quality in this case lies in the algorithm effectiveness to utilize the minima rule [17][18], [22][23], [27], [30][31], [46][47]. The most crucial issue when dealing with the minima rule is noise.…”
Section: Discussionmentioning
confidence: 99%
See 3 more Smart Citations
“…From all algorithms, the most popular are those that use the minima-rule to segment the mesh. Therefore the measure of quality in this case lies in the algorithm effectiveness to utilize the minima rule [17][18], [22][23], [27], [30][31], [46][47]. The most crucial issue when dealing with the minima rule is noise.…”
Section: Discussionmentioning
confidence: 99%
“…al. [46] Gaussian Curvature Gaussian Curvature value above a user defined threshold Zuckerberger et. al.…”
Section: Methodsmentioning
confidence: 99%
See 2 more Smart Citations
“…In these methods, a seed point is first selected and then grown, in order to find final regions. This often leads to oversegmentation (Zhang et al, 2002). Watershed-based approaches are also subject to over-segmentation of the 3D models (Agathos et al, 2007).…”
Section: Related Workmentioning
confidence: 99%