Parallel View-Dependent Tessellation of Catmull-Clark Subdivision Surfaces
Loading...
Date
2009
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
We present a strategy for performing view-adaptive, crack-free tessellation of Catmull-Clark subdivision surfaces entirely on programmable graphics hardware. Our scheme extends the concept of breadth-first subdivision, which up to this point has only been applied to parametric patches. While mesh representations designed for a CPU often involve pointer-based structures and irregular perelement storage, neither of these is well-suited to GPU execution. To solve this problem, we use a simple yet effective data structure for representing a subdivision mesh, and design a careful algorithm to update the mesh in a completely parallel manner. We demonstrate that in spite of the complexities of the subdivision procedure, real-time tessellation to pixel-sized primitives can be done. Our implementation does not rely on any approximation of the limit surface, and avoids both subdivision cracks and T-junctions in the subdivided mesh. Using the approach in this paper, we are able to perform real-time subdivision for several static as well as animated models. Rendering performance is scalable for increasingly complex models.
Description
@inproceedings{:10.1145/1572769.1572785,
booktitle = {High-Performance Graphics},
editor = {David Luebke and Philipp Slusallek},
title = {{Parallel View-Dependent Tessellation of Catmull-Clark Subdivision Surfaces}},
author = {Patney, Anjul and Ebeida, Mohamed S. and Owens, John D.},
year = {2009},
publisher = {The Eurographics Association},
ISSN = {2079-8687},
ISBN = {978-1-60558-603-8},
DOI = {/10.1145/1572769.1572785}
}