DMCA
Out-of-Core Simplification of Large Polygonal Models (2000)
Cached
Download Links
| Citations: | 159 - 10 self |
BibTeX
@MISC{Lindstrom00out-of-coresimplification,
author = {Peter Lindstrom},
title = {Out-of-Core Simplification of Large Polygonal Models},
year = {2000}
}
Share
 |
 |
 |
 |
||
OpenURL
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
