DocumentCode
2555682
Title
A unified approach for simplifying polygonal and spline models
Author
Gopi, M. ; Manocha, D.
Author_Institution
Dept. of Comput. Sci., North Carolina Univ., Chapel Hill, NC, USA
fYear
1998
fDate
24-24 Oct. 1998
Firstpage
271
Lastpage
278
Abstract
We present a new approach for simplifying models composed of polygons or spline patches. Given an input model, the algorithm computes a new representation of the model in terms of triangular Bezier patches. It performs a series of geometric operations, consisting of patch merging and swapping diagonals, and makes use of batch connectivity information to generate C-LODs (curved levels-of-detail). Each C-LOD is represented using cubic triangular Bezier patches. The C-LODs provide a compact representation for storing the model. The algorithm tries to minimize the surface deviation error and maintains continuity at patch boundaries. Given the CLODs, the algorithm can generate their polygonal approximations using static and dynamic tessellation schemes. It has been implemented and we highlight its performance on a number of polygonal and spline models.
Keywords
computational geometry; polynomials; splines (mathematics); batch connectivity information; curved levels-of-detail; dynamic tessellation schemes; geometric operations; model simplification; polygonal approximations; polygonal models; spline models; static tessellation schemes; surface approximation; surface deviation error; surface fitting; triangular Bezier patches; Approximation algorithms; Clustering algorithms; Computational geometry; Computer graphics; Computer science; Heuristic algorithms; Merging; Solid modeling; Spline; Surface fitting; Topology; Vehicle dynamics;
fLanguage
English
Publisher
ieee
Conference_Titel
Visualization '98. Proceedings
Conference_Location
Research Triangle Park, NC, USA
ISSN
1070-2385
Print_ISBN
0-8186-9176-X
Type
conf
DOI
10.1109/VISUAL.1998.745313
Filename
745313
Link To Document