Mesh parameterization based on edge collapse
Parameterizations that use mesh simplification to build the base domain always adopt the vertex removal scheme. This paper applies edge collapse to constructing the base domain instead. After inducing the parameterization of the original mesh over the base domain, new algorithms map the new vertices...
Saved in:
Published in | Journal of Zhejiang University. A. Science Vol. 10; no. 8; pp. 1153 - 1159 |
---|---|
Main Authors | , , , |
Format | Journal Article |
Language | English |
Published |
Hangzhou
Zhejiang University Press
01.08.2009
|
Subjects | |
Online Access | Get full text |
Cover
Loading…
Summary: | Parameterizations that use mesh simplification to build the base domain always adopt the vertex removal scheme. This paper applies edge collapse to constructing the base domain instead. After inducing the parameterization of the original mesh over the base domain, new algorithms map the new vertices in the simplified mesh back to the original one according to the edge transition sequence to integrate the parameterization. We present a direct way, namely edge classification, to deduce the sequence. Experimental results show that the new parameterization features considerable saving in computing complexity and maintains smoothness. |
---|---|
Bibliography: | F127 TP391.41 Edge collapse, Vertex removal, Mapping, Edge classification 33-1236/O4 ObjectType-Article-2 SourceType-Scholarly Journals-1 ObjectType-Feature-1 content type line 23 |
ISSN: | 1673-565X 1862-1775 |
DOI: | 10.1631/jzus.A0820428 |