Name
Abstract | ||
|---|---|---|
A scheme for delayed tesselation of Catmull/Clark surfaces is described where only changes of the control mesh and changes in visibility create workload. Tesselation is performed on demand and is typically spread over a number of frames, so that the number of perceivable frame-rate drops is minimized. No special preprocessing stage is necessary, and applications have the greatest freedom for control-mesh manipulation. The tesselation scheme is ideally suited for interactive applications such as modeling and animation. The number of operations for computing regular tesselations is analyzed, and the most expensive part is optimized. The display procedure uses precomputed index arrays to switch between different adaptive triangulations at no additional cost. |
Year | DOI | Venue |
|---|---|---|
2002 | 10.1007/s003710100151 | VISUAL COMPUTER |
Keywords | Field | DocType |
subdivision surfaces,Catmull/Clark,view-dependent rendering,tesselation on demand,adaptive tesselation | Computer vision,Visibility,Computer graphics (images),Computer science,Workload,Preprocessor,Frame rate,Animation,Artificial intelligence,Tessellation,Rendering (computer graphics),Catmull–Clark subdivision surface | Journal |
Volume | Issue | ISSN |
18 | 5-6 | 0178-2789 |
Citations | PageRank | References |
3 | 1.17 | 10 |
Authors | ||
2 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Sven Havemann | 1 | 160 | 21.41 |
| tu braunschweig | 2 | 3 | 1.17 |