Premium
Full‐range approximation of triangulated polyhedra.
Author(s) -
Ronfard Rémi,
Rossignac Jarek
Publication year - 1996
Publication title -
computer graphics forum
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.578
H-Index - 120
eISSN - 1467-8659
pISSN - 0167-7055
DOI - 10.1111/1467-8659.1530067
Subject(s) - polyhedron , rendering (computer graphics) , computer science , segmentation , range (aeronautics) , artificial intelligence , object (grammar) , computer vision , algorithm , mathematics , geometry , materials science , composite material
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.