| Hardware support for adaptive subdivision surface rendering |
| Full text |
Pdf
(396 KB)
|
| Source
|
SIGGRAPH/EUROGRAPHICS Conference On Graphics Hardware
archive
Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
table of contents
Los Angeles, California, United States
Pages: 33 - 40
Year of Publication: 2001
ISBN:1-58113-407-X
|
|
Authors
|
|
M. Bóo
|
Dept. of Electronic and Computer Engineering, University of Santiago de Compostela. Spain
|
|
M. Amor
|
Dept. of Electronic and Systems, University of La Coruña, Spain
|
|
M. Doggett
|
WSI/GRIS, University of Tübingen, Germany
|
|
J. Hirche
|
WSI/GRIS, University of Tübingen, Germany
|
|
W. Strasser
|
WSI/GRIS, University of Tübingen, Germany
|
|
| Sponsor |
|
| Publisher |
|
| Bibliometrics |
Downloads (6 Weeks): 4, Downloads (12 Months): 35, Citation Count: 12
|
|
|
ABSTRACT
Adaptive subdivision of triangular meshes is highly desirable for surface generation algorithms including adaptive displacement mapping in which a highly detailed model can be constructed from a coarse triangle mesh and a displacement map. The communication requirements between the CPU and the graphics pipeline can be reduced if more detailed and complex surfaces are generated, as in displacement mapping, by an adaptive tessellation unit which is part of the graphics pipeline. Generating subdivision surfaces requires a large amount of memory in whicmultiple arbitrary accesses are required to neighbouring vertices to calculate the new vertices. In this paper we present a meshing scheme and new architecture for the implementation of adaptive subdivision of triangular meshes that allows for quick access using a small memory making it feasible in hardware, while at the same time allowing for new vertices to be adaptively inserted. The architecutre is regular and characterized by an efficient data management that minimizes the data storage and avoids the wait cycles that would be associated with the multiple data accesses required for traditional subdivision. This architecture is presented as an improvement for adaptive displacement mapping algorithms, but could also be used for adaptive subdivision surface generation in hardware.
REFERENCES
Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.
| |
1
|
M. Amor, M. Boo, M. Doggett, J. Hirche, and W. Strasser. A Meshing Scheme for Memory Efficient Adaptive Rendering of Subdivision Surfaces. Technical Report WSI-2000- 21, Universitat Tubingen, WSI/GRIS (http://www.gris.unituebingen. de), 2000.
|
 |
2
|
|
 |
3
|
|
 |
4
|
|
 |
5
|
|
| |
6
|
|
 |
7
|
|
| |
8
|
|
| |
9
|
C. Loop. Smooth Subdivision Surfaces Based on Triangles. PhD thesis, University of Utah, Dept. of Mathematics, 1987.
|
| |
10
|
P. Schroder and D. Zorin (Organizers). Subdivision for Modeling and Animation. In SIGGRAPH 00 Course Notes.ACM SIGGRAPH, 2000.
|
 |
11
|
|
|