Math @ Duke

Publications [#235400] of Pankaj K. Agarwal
Papers Published
 Cohen, J; Varshney, A; Manocha, D; Turk, G; Weber, H; Agarwal, P; Brooks, F; Wright, W, Simplification envelopes,
in SIGGRAPH,
Proceedings of the ACM SIGGRAPH Conference on Computer Graphics
(1996),
pp. 119128
(last updated on 2018/05/23)
Abstract: We propose the idea of simplification envelopes for generating a hierarchy of levelofdetail approximations for a given polygonal model. Our approach guarantees that all points of an approximation are within a userspecifiable distance ε from the original model and that all points of the original model are within a distance ε from the approximation. Simplification envelopes provide a general framework within which a large collection of existing simplification algorithms can run. We demonstrate this technique in conjunction with two algorithms, one local, the other global. The local algorithm provides a fast method for generating approximations to large input meshes (at least hundreds of thousands of triangles). The global algorithm provides the opportunity to avoid local `minima' and possibly achieve better simplifications as a result. Each approximation attempts to minimize the total number of polygons required to satisfy the above ε constraint. The key advantages of our approach are: General technique providing guaranteed error bounds for genuspreserving simplification; Automation of both the simplification process and the selection of appropriate viewing distances; Prevention of selfintersection; Preservation of sharp features; and Allows variation of approximation distance across different portions of a model.


dept@math.duke.edu
ph: 919.660.2800
fax: 919.660.2821
 
Mathematics Department
Duke University, Box 90320
Durham, NC 277080320

