Parallel Loop Subdivision with Sparse Adjacency Matrix
No Thumbnail Available
Date
2023
Authors
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
Subdivision surface is a popular technique for geometric modeling. Recently, several parallel implementations have been developed for Loop subdivision on the GPU. However, these methods are built on complex data structures which complicate the implementation and affect the performance, especially on the GPU. In this work, we propose to simply use the sparse adjacency matrix which enables us to implement the Loop subdivision scheme in the most straightforward manner. Our implementation run entirely on the GPU and achieves high performance in runtime with significantly lower memory consumption than the state-of-the-art. Through extensive experiments and comparisons, we demonstrate the efficacy and efficiency of our method.
Description
CCS Concepts: Computing methodologies → Computer graphics; Mesh models
@inproceedings{10.2312:egs.20231012,
booktitle = {Eurographics 2023 - Short Papers},
editor = {Babaei, Vahid and Skouras, Melina},
title = {{Parallel Loop Subdivision with Sparse Adjacency Matrix}},
author = {Wang, Kechun and Chen, Renjie},
year = {2023},
publisher = {The Eurographics Association},
ISSN = {1017-4656},
ISBN = {978-3-03868-209-7},
DOI = {10.2312/egs.20231012}
}