We have proposed a new edge collapse simplification algorithm that can produce efficiently high quality approximations of closed manifold surface models. To reduce the number of triangular faces in a polygonal model, a sequence of edge collapses is performed and to choose the appropriate sequence of edge collapses, we have introduced a new error metric based on a quantity proportional to the volume of a tetrahedron. Our proposed algorithm is simple, fast and memory efficient and, can efficiently reduce very large polygonal surface models, Moreover, simplified models created using our method preserve the essential features of a model and compare favorably to many well-known published simplification techniques in terms of maximum geometric error and mean geometric error and bear high visual reliability even after significant simplification.
|Title of host publication
|Proceedings - 5th International Conference on Information Visualisation, IV 2001
|F. Khosrowshahi, E. Banissi, M. Sarfraz, A. Ursyn
|Institute of Electrical and Electronics Engineers Inc.
|Number of pages
|Published - 2001
|5th International Conference on Information Visualisation, IV 2001 - London, United Kingdom
Duration: Jul 25 2001 → Jul 27 2001
|Proceedings of the International Conference on Information Visualisation
|5th International Conference on Information Visualisation, IV 2001
|7/25/01 → 7/27/01
All Science Journal Classification (ASJC) codes
- Signal Processing
- Computer Vision and Pattern Recognition