On Exact Error Bounds for View-Dependent Simplification

dc.contributor.authorEisemann, E.en_US
dc.contributor.authorDecoret, X.en_US
dc.date.accessioned2015-02-21T12:41:47Z
dc.date.available2015-02-21T12:41:47Z
dc.date.issued2007en_US
dc.description.abstractIn 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 preceding 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 for mesh 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.en_US
dc.description.number2en_US
dc.description.seriesinformationComputer Graphics Forumen_US
dc.description.volume26en_US
dc.identifier.doi10.1111/j.1467-8659.2007.01013.xen_US
dc.identifier.issn1467-8659en_US
dc.identifier.pages202-213en_US
dc.identifier.urihttps://doi.org/10.1111/j.1467-8659.2007.01013.xen_US
dc.publisherThe Eurographics Association and Blackwell Publishing Ltden_US
dc.titleOn Exact Error Bounds for View-Dependent Simplificationen_US
Files
Collections