On Exact Error Bounds for View-Dependent Simplification - Archive ouverte HAL Access content directly
Journal Articles Computer Graphics Forum Year : 2007

On Exact Error Bounds for View-Dependent Simplification


In this article we present an analytical closed-form expression to ensure exact error bounds for view-dependent simplification which is of importance for several algorithms. The present work contains proofs and solutions for the general 2D case and particular 3D cases. Most preceeding works rely on coarse heuristics, that might fail and/or restrict movements or object representations. We introduce the notion of validity regions as the complete set of possible simplifications respecting a given error bound between the object and its simplification. The approach handles arbitrary polygonal viewcells which allow for free movement in the interior. We show how to compute these regions foresh points and faces. Since the validity region of a face accounts for all its points, properties like silhouette preservation and textures are gracefully handled. This is not the case if the error is controlled only at the face's vertices or edges.
Vignette du fichier
validityRegions.jpg (11.43 Ko) Télécharger le fichier Fichier principal
Vignette du fichier
viewdepArticle.pdf (2.09 Mo) Télécharger le fichier
Format : Figure, Image
Origin : Publisher files allowed on an open archive

Dates and versions

hal-00171416 , version 1 (29-04-2011)



Elmar Eisemann, Xavier Décoret. On Exact Error Bounds for View-Dependent Simplification. Computer Graphics Forum, 2007, 26 (2), pp.202-213. ⟨10.1111/j.1467-8659.2007.01013.x⟩. ⟨hal-00171416⟩
188 View
197 Download



Gmail Facebook Twitter LinkedIn More