DocumentCode :
3471408
Title :
A Memory Efficient Simplification Algorithm of Polygonal Meshes
Author :
Zhao, Yongsheng ; Li, Lingyun ; Song, Lihua
Author_Institution :
Ludong Univ. Yantai, Yantai
fYear :
2007
fDate :
18-21 Aug. 2007
Firstpage :
1033
Lastpage :
1036
Abstract :
We present a new model simplification algorithm based on edge collapse. The measure of geometric deviation resulted from an edge collapse transformation plays a basic role in the simplification process. We give a new technique to measure this deviation, which try to measure the change of area and normal of triangles adjacent to the contracting edge. The algorithm is easy to implement and involve simple computations, so it is computationally efficient. The error cost is based only on current simplified model, which means no geometric history is needed to be retained, so the algorithm is also memory efficient. Results and numerical comparisons show that our algorithm generates simplified models of good visual fidelity, which compares well with those by other methods in terms of maximum and mean geometric error and it preserves the visually important features of the original model.
Keywords :
computational geometry; computer graphics; edge detection; edge collapse; geometric error; memory efficient simplification algorithm; polygonal meshes; Application software; Area measurement; Automation; Clustering algorithms; Computer errors; Costs; Geometry; History; Logistics; Solid modeling; Collapse; Geometry; Half-edge; Normal; Simplification;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Automation and Logistics, 2007 IEEE International Conference on
Conference_Location :
Jinan
Print_ISBN :
978-1-4244-1531-1
Type :
conf
DOI :
10.1109/ICAL.2007.4338719
Filename :
4338719
Link To Document :
بازگشت