Dupuy, JonathanVanhoey, KennethBinder, Nikolaus and Ritschel, Tobias2021-07-052021-07-0520211467-8659https://doi.org/10.1111/cgf.14381https://diglib.eg.org:443/handle/10.1111/cgf14381We 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.Computing methodologiesMassively parallel algorithmsRendering10.1111/cgf.1438157-70