Full-range approximation of triangulated polyhedra.
| dc.contributor.author | Ronfard, Remi | en_US |
| dc.contributor.author | Rossignac, Jarek | en_US |
| dc.date.accessioned | 2014-10-21T07:43:44Z | |
| dc.date.available | 2014-10-21T07:43:44Z | |
| dc.date.issued | 1996 | en_US |
| dc.description.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. | en_US |
| dc.description.number | 3 | en_US |
| dc.description.seriesinformation | Computer Graphics Forum | en_US |
| dc.description.volume | 15 | en_US |
| dc.identifier.doi | 10.1111/1467-8659.1530067 | en_US |
| dc.identifier.issn | 1467-8659 | en_US |
| dc.identifier.pages | 67-76 | en_US |
| dc.identifier.uri | https://doi.org/10.1111/1467-8659.1530067 | en_US |
| dc.publisher | Blackwell Science Ltd and the Eurographics Association | en_US |
| dc.title | Full-range approximation of triangulated polyhedra. | en_US |