Vanhoey, KennethDupuy, JonathanPelechano, NuriaVanderhaeghe, David2022-04-222022-04-222022978-3-03868-169-41017-4656https://doi.org/10.2312/egs.20221028https://diglib.eg.org:443/handle/10.2312/egs20221028We observe that a Loop refinement step invariably splits halfedges into four new ones. We leverage this observation to formulate a breadth-first uniform Loop subdivision algorithm: Our algorithm iterates over halfedges to both generate the refined topological information and scatter contributions to the refined vertex points. Thanks to this formulation we limit concurrent data access, enabling straightforward and efficient parallelization on the GPU. We provide an open-source GPU implementation that runs at state-of-the-art performances and supports production-ready assets, including borders and semi-sharp creases.Attribution 4.0 International LicenseCCS Concepts: Computing methodologies --> Computer graphics; Mesh modelsComputing methodologiesComputer graphicsMesh models10.2312/egs.2022102841-444 pages