DMCA
Simplification Envelopes
Cached
Download Links
| Citations: | 206 - 17 self |
BibTeX
@INPROCEEDINGS{Cohen_simplificationenvelopes,
author = {Jonathan Cohen and Amitabh Varshney and Dinesh Manocha and Greg Turk and Hans Weber and Pankaj Agarwal and Frederick Brooks and William Wright},
title = {Simplification Envelopes},
booktitle = {},
year = {},
pages = {119--128},
publisher = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
We propose the idea of simplification envelopes for generating a hierarchy of level-of-detail approximations for a given polygonal model. Our approach guarantees that all points of an approximation are within a user-specifiable distance # from the original model and that all points of the original model are within a distance # from the approximation. Simplificationenvelopes provide a general framework within which a large collection of existing simplification algorithms can run. We demonstrate this technique in conjunction with two algorithms, one local, the other global. The local algorithm provides a fast method for generating approximations to large input meshes (at least hundreds of thousands of triangles). The global algorithm provides the opportunity to avoid local "minima" and possibly achieve better simplifications as a result. Each approximation attempts to minimize the total number of polygons required to satisfy the above # constraint. The key advantages of our approach are...
Keyphrases
simplification envelope original model large input mesh general framework large collection level-of-detail approximation user-specifiable distance local minimum simplification algorithm local algorithm global algorithm approach guarantee total number fast method key advantage polygonal model
