dc.contributor.author	Dupuy, Jonathan	en_US
dc.contributor.author	Vanhoey, Kenneth	en_US
dc.contributor.editor	Binder, Nikolaus and Ritschel, Tobias	en_US
dc.date.accessioned	2021-07-05T07:44:00Z
dc.date.available	2021-07-05T07:44:00Z
dc.date.issued	2021
dc.description.abstract	We show that Catmull-Clark subdivision induces an invariant one-to-four refinement rule for halfedges that reduces to simple algebraic expressions. This has two important consequences. First, it allows to refine the halfedges of the input mesh, which completely describe its topology, concurrently in breadth-first order. Second, it makes the computation of the vertex points straightforward as the halfedges provide all the information that is needed. We leverage these results to derive a novel parallel implementation of Catmull-Clark subdivision suitable for the GPU. Our implementation supports non-quad faces, extraordinary vertices, boundaries and semi-sharp creases seamlessly. Moreover, we show that its speed scales linearly with the number of processors, and yields state-of-the-art performances on modern GPUs.	en_US
dc.description.number	8
dc.description.sectionheaders	Geometry and Optimization
dc.description.seriesinformation	Computer Graphics Forum
dc.description.volume	40
dc.identifier.doi	10.1111/cgf.14381
dc.identifier.issn	1467-8659
dc.identifier.pages	57-70
dc.identifier.uri	https://doi.org/10.1111/cgf.14381
dc.identifier.uri	https://diglib.eg.org:443/handle/10.1111/cgf14381
dc.publisher	The Eurographics Association and John Wiley & Sons Ltd.	en_US
dc.subject	Computing methodologies
dc.subject	Massively parallel algorithms
dc.subject	Rendering
dc.title	A Halfedge Refinement Rule for Parallel Catmull-Clark Subdivision	en_US

A Halfedge Refinement Rule for Parallel Catmull-Clark Subdivision

Files

Original bundle

Collections