Proceedings of Seventh Annual IEEE Visualization '96
DOI: 10.1109/visual.1996.568124
|View full text |Cite
|
Sign up to set email alerts
|

Mesh reduction with error control

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
75
0
1

Publication Types

Select...
4
3
3

Relationship

0
10

Authors

Journals

citations
Cited by 102 publications
(76 citation statements)
references
References 9 publications
0
75
0
1
Order By: Relevance
“…Models produced by icon inflation tend to be smooth making them viable candidates for well-established mesh reduction algorithms [9] if optimization is required.…”
Section: Discussionmentioning
confidence: 99%
“…Models produced by icon inflation tend to be smooth making them viable candidates for well-established mesh reduction algorithms [9] if optimization is required.…”
Section: Discussionmentioning
confidence: 99%
“…Other algorithms assume that the input model is a valid mesh. Algorithms based on vertex removal [4,5] and local error metrics have been proposed by [6][7][8][9][10]. Cohen et al [11] and Eck et al [12] have presented algorithms that preserve topology and use a global error bound.…”
Section: Geometric Levels-of-detailmentioning
confidence: 99%
“…For our purposes it is most important to conserve the silhouette of the object. We believe that the best approach would be to minimize the two-sided Haussdorff distance as proposed in [16]. But so far we did not find an algorithm which is fast enough.…”
Section: Filter Level Generationmentioning
confidence: 99%