Edge-Friend: Fast and Deterministic Catmull-Clark Subdivision Surfaces
| dc.contributor.author | Kuth, Bastian | en_US |
| dc.contributor.author | Oberberger, Max | en_US |
| dc.contributor.author | Chajdas, Matthäus | en_US |
| dc.contributor.author | Meyer, Quirin | en_US |
| dc.contributor.editor | Bikker, Jacco | en_US |
| dc.contributor.editor | Gribble, Christiaan | en_US |
| dc.date.accessioned | 2023-06-25T09:03:48Z | |
| dc.date.available | 2023-06-25T09:03:48Z | |
| dc.date.issued | 2023 | |
| dc.description.abstract | We present edge-friend, a data structure for quad meshes with access to neighborhood information required for Catmull-Clark subdivision surface refinement. Edge-friend enables efficient real-time subdivision surface rendering. In particular, the resulting algorithm is deterministic, does not require hardware support for atomic floating-point arithmetic, and is optimized for efficient rendering on GPUs. Edge-friend exploits that after one subdivision step, two edges can be uniquely and implicitly assigned to each quad. Additionally, edge-friend is a compact data structure, adding little overhead. Our algorithm is simple to implement in a single compute shader kernel, and requires minimal synchronization which makes it particularly suited for asynchronous execution. We easily extend our kernel to support relevant Catmull-Clark subdivision surface features, including semi-smooth creases, boundaries, animation and attribute interpolation. In case of topology changes, our data structure requires little preprocessing, making it amendable for a variety of applications, including real-time editing and animations. Our method can process and render billions of triangles per second on modern GPUs. For a sample mesh, our algorithm generates and renders 2.9 million triangles in 0.58ms on an AMD Radeon RX 7900 XTX GPU. | en_US |
| dc.description.number | 8 | |
| dc.description.sectionheaders | Acceleration Structures | |
| dc.description.seriesinformation | Computer Graphics Forum | |
| dc.description.volume | 42 | |
| dc.identifier.doi | 10.1111/cgf.14863 | |
| dc.identifier.issn | 1467-8659 | |
| dc.identifier.pages | 11 pages | |
| dc.identifier.uri | https://doi.org/10.1111/cgf.14863 | |
| dc.identifier.uri | https://diglib.eg.org:443/handle/10.1111/cgf14863 | |
| dc.publisher | The Eurographics Association and John Wiley & Sons Ltd. | en_US |
| dc.subject | CCS Concepts: Computing methodologies -> Rendering; Parametric curve and surface models; Massively parallel algorithms | |
| dc.subject | Computing methodologies | |
| dc.subject | Rendering | |
| dc.subject | Parametric curve and surface models | |
| dc.subject | Massively parallel algorithms | |
| dc.title | Edge-Friend: Fast and Deterministic Catmull-Clark Subdivision Surfaces | en_US |