Abstract | ||
---|---|---|
We present a novel algorithm for dynamic adaptive triangulation of spline surfaces. The algorithm is dynamic because it adjusts the level of detail of the triangulation at each frame. It is adaptive be- cause it samples each surface patch more densely in regions of high curvature and less densely in regions of low curvature. The two have not been combined before. Our algorithm pre-computes a pri- oritized list of important samples on the surface. At rendering time, it adds these points in the specified order to the triangulation. Once the pre-computed points are exhausted and even more detail is re- quired on some region of the patch, additional samples, now uni- formly spaced, are added to the triangulation. The algorithm works well in practice and has a low memory footprint. CR Categories and Subject Descriptors: I.3.m (Computer Graph- ics): Spline, Surface display, Adaptive tessellation, Levels of detail |
Year | DOI | Venue |
---|---|---|
2001 | 10.1145/364338.364349 | SI3D |
Keywords | Field | DocType |
spline surface,view-dependent adaptive tessellation,importance sampling,level of detail,spline | Spline (mathematics),Computer vision,Curvature,Computer graphics (images),Computer science,Level of detail,Triangulation (social science),Artificial intelligence,Tessellation,Memory footprint,Rendering (computer graphics) | Conference |
ISBN | Citations | PageRank |
1-58113-292-1 | 6 | 0.60 |
References | Authors | |
22 | 2 |
Name | Order | Citations | PageRank |
---|---|---|---|
Jatin Chhugani | 1 | 1452 | 79.32 |
Subodh Kumar | 2 | 527 | 49.65 |