Given the framework of incremental mesh simplification based on edgecollapse, the paper proposes a mesh simplification algorithm using an improved approach formeasuring simplification error. The algorithm uses edge co...Given the framework of incremental mesh simplification based on edgecollapse, the paper proposes a mesh simplification algorithm using an improved approach formeasuring simplification error. The algorithm uses edge collapse to simplify the trianglemesh andmaintains surface error approximations using c-error for the faces which have changed after edgecollapse and d-crror for the faces which become degenerated after edge collapse. Also, we reportsome results using a variety of computer graphics models, which can show that the algorithm canachieve the desired simplification effect.展开更多
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 parameterizati...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.展开更多
基金Supported by the Key Science Technology Project of China (2001BA102A04 02 03)
文摘Given the framework of incremental mesh simplification based on edgecollapse, the paper proposes a mesh simplification algorithm using an improved approach formeasuring simplification error. The algorithm uses edge collapse to simplify the trianglemesh andmaintains surface error approximations using c-error for the faces which have changed after edgecollapse and d-crror for the faces which become degenerated after edge collapse. Also, we reportsome results using a variety of computer graphics models, which can show that the algorithm canachieve the desired simplification effect.
基金supported by the National Natural Science Foundation of China (Nos.60273060,60333010 and 60473106)the Research Fund for the Doctoral Program of Higher Education of China (No.20030335064)
文摘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.
