ACM Home Page
Please provide us with feedback. Feedback
Out-of-core simplification of large polygonal models
Full text PdfPdf (584 KB)
Source International Conference on Computer Graphics and Interactive Techniques archive
Proceedings of the 27th annual conference on Computer graphics and interactive techniques table of contents
Pages: 259 - 262  
Year of Publication: 2000
ISBN:1-58113-208-5
Author
Peter Lindstrom  Georgia Institute of Technology
Sponsor
SIGGRAPH: ACM Special Interest Group on Computer Graphics and Interactive Techniques
Publisher
ACM Press/Addison-Wesley Publishing Co.  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 26,   Downloads (12 Months): 95,   Citation Count: 61
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/344779.344912
What is a DOI?

ABSTRACT

We present an algorithm for out-of-core simplification of large polygonal datasets that are too complex to fit in main memory. The algorithm extends the vertex clustering scheme of Rossignac and Borrel [13] by using error quadric information for the placement of each cluster's representative vertex, which better preserves fine details and results in a low mean geometric error. The use of quadrics instead of the vertex grading approach in [13] has the additional benefits of requiring less disk space and only a single pass over the model rather than two. The resulting linear time algorithm allows simplification of datasets of arbitrary complexity. In order to handle degenerate quadrics associated with (near) flat regions and regions with zero Gaussian curvature, we present a robust method for solving the corresponding underconstrained least-squares problem. The algorithm is able to detect these degeneracies and handle them gracefully. Key features of the simplification method include a bounded Hausdorff error, low mean geometric error, high simplification speed (up to 100,000 triangles/second reduction), output (but not input) sensitive memory requirements, no disk space overhead, and a running time that is independent of the order in which vertices and triangles occur in the mesh.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

 
1
ACKERMAN, M. J. The Visible Human Project. In Proceedings of the IEEE, 86(3), March 1998, pp. 504-511. Project URL: http://ww~nlm.nih.gov/ research/visible.
 
2
BERNARDINI, F., MITTLEMAN, J., and RUSHMEIER, H. Case Study: Scanning Michelangelo's Florentine Pieth. In ACM SIGGRAPH 99 Course Notes, Course 8, August 1999. Project URL: http://www.research.ibm, com/pieta.
 
3
 
4
 
5
 
6
 
7
LEVOY, M. The Digital Michelangelo Project. In proceedings of the Second international Conference on 3D Digital imaging and Modeling, October 1999, pp. 2-11. Project URL: http://graphics.stanford, edu/ projects~ mich.
 
8
9
 
10
 
11
 
12
RONFARD, R. and ROSSIGNAC, J. Full-Range Approximation of Triangulated Polyhedra. Proceedings of Eurographics 96. In Computer Graphics Forum, 15(3), August 1996, pp. 67-76.
 
13
ROSSIGNAC, J. and BORREL, P. Multi-Resolution 3D Approximations for Rendering Complex Scenes. In Modeling in Computer Graphics, edited by B. Falcidieno and T. L. Kunii, Springer-Verlag, 1993, pp. 455-465.

CITED BY  61