dc.contributor.author	Vanhoey, Kenneth	en_US
dc.contributor.author	Dupuy, Jonathan	en_US
dc.contributor.editor	Pelechano, Nuria	en_US
dc.contributor.editor	Vanderhaeghe, David	en_US
dc.date.accessioned	2022-04-22T08:16:12Z
dc.date.available	2022-04-22T08:16:12Z
dc.date.issued	2022
dc.description.abstract	We 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.	en_US
dc.description.sectionheaders	Geometry and Shape
dc.description.seriesinformation	Eurographics 2022 - Short Papers
dc.identifier.doi	10.2312/egs.20221028
dc.identifier.isbn	978-3-03868-169-4
dc.identifier.issn	1017-4656
dc.identifier.pages	41-44
dc.identifier.pages	4 pages
dc.identifier.uri	https://doi.org/10.2312/egs.20221028
dc.identifier.uri	https://diglib.eg.org:443/handle/10.2312/egs20221028
dc.publisher	The Eurographics Association	en_US
dc.rights	Attribution 4.0 International License
dc.rights.uri	https://creativecommons.org/licenses/by/4.0/
dc.subject	CCS Concepts: Computing methodologies --> Computer graphics; Mesh models
dc.subject	Computing methodologies
dc.subject	Computer graphics
dc.subject	Mesh models
dc.title	A Halfedge Refinement Rule for Parallel Loop Subdivision	en_US

A Halfedge Refinement Rule for Parallel Loop Subdivision

Files

Original bundle

Collections