Full-range approximation of triangulated polyhedra

Rémi Ronfard 1 J. Rossignac 2
1 MOVI - Modeling, localization, recognition and interpretation in computer vision
GRAVIR - IMAG - Graphisme, Vision et Robotique, Inria Grenoble - Rhône-Alpes, CNRS - Centre National de la Recherche Scientifique : FR71
Abstract : We propose a new algorithm for automatically computing approximations of a given polyhedral object at different levels of details. The applications for this algorithm is the display of very complex scenes. Our approach is similar to the region-merging method used in 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.
Document type :
Journal articles
Complete list of metadatas

https://hal.inria.fr/inria-00545167
Contributor : Rémi Ronfard <>
Submitted on : Thursday, September 11, 2014 - 12:18:02 PM
Last modification on : Wednesday, April 11, 2018 - 1:59:25 AM

Links full text

Identifiers

Collections

IMAG | CNRS | INRIA | UGA

Citation

Rémi Ronfard, J. Rossignac. Full-range approximation of triangulated polyhedra. Computer Graphics Forum, Wiley, 1996, Eurographics, 15 (3), pp.67-76. ⟨10.1111/1467-8659.1530067⟩. ⟨inria-00545167⟩

Share

Metrics

Record views

565