loading...
 This Article 
   
 Share 
   
 Bibliographic References 
   
 Add to: 
 
Digg
Furl
Spurl
Blink
Simpy
Google
Del.icio.us
Y!MyWeb
 
 Search 
   
Ninth IEEE Visualization 1998 (VIS '98)
Fast and Memory Efficient Polygonal Simplification
Research Triangle Park, North Carolina
October 18-October 23
ISBN: 0-8186-9176-x
Peter Lindstrom, Georgia Institute of Technology
Greg Turk, Georgia Institute of Technology
Conventional wisdom says that in order to produce high-quality simplified polygonal models, one must retain and use information about the original model during the simplification process. We demonstrate that excellent simplified models can be produced without the need to compare against information from the original geometry while performing local changes to the model. We use edge collapses to perform simplification, as do a number of other methods. We select the position of the new vertex so that the original volume of the model is maintained and we minimize the per-triangle change in volume of the tetrahedra swept out by those triangles that are moved. We also maintain surface area near boundaries and minimize the per-triangle area changes. Calculating the edge collapse priorities and the positions of the new vertices requires only the face connectivity and the the vertex locations in the intermediate model. This approach is memory efficient, allowing the simplification of very large polygonal models, and it is also fast. Moreover, simplified models created using this technique compare favorably to a number of other published simplification methods in terms of mean geometric error.
Citation:
Peter Lindstrom, Greg Turk, "Fast and Memory Efficient Polygonal Simplification," ieee_vis, pp.279, Ninth IEEE Visualization 1998 (VIS '98), 1998
Usage of this product signifies your acceptance of the Terms of Use.