Full-range approximation of triangulated polyhedra.

Loading...
Thumbnail Image
Date
1996
Journal Title
Journal ISSN
Volume Title
Publisher
Blackwell Science Ltd and the Eurographics Association
Abstract
We propose a new algorithm for automatically computing approximations of a given polyhedral object at different levels of details. The application for this algorithm is the display of very complex scenes. where many objects are seen with a range of varying levels of detail. Our approach is similar to the region-merging method used for image segmentation. We iteratively collapse edges, based on a measure of the geometric deviation from the initial shape. When edges are merged in the right order, this strategy produces a continuum of valid approximations of the original object, which can be used for faster rendering at vastly different scales.
Description

        
@article{
10.1111:1467-8659.1530067
, journal = {Computer Graphics Forum}, title = {{
Full-range approximation of triangulated polyhedra.
}}, author = {
Ronfard, Remi
and
Rossignac, Jarek
}, year = {
1996
}, publisher = {
Blackwell Science Ltd and the Eurographics Association
}, ISSN = {
1467-8659
}, DOI = {
10.1111/1467-8659.1530067
} }
Citation