arXiv · 2403.14723
GPolylla: Fully GPU-accelerated polygonal mesh generator
Abstract
This work presents a fully GPU-accelerated algorithm for the polygonal mesh generator known as Polylla. Polylla is a tri-to-polygon mesh generator, which benefits from the half-edge data structure to manage any polygonal shape. The proposed parallel algorithm introduces a novel approach to modify triangulations to get polygonal meshes using the half-edge data structure in parallel on the GPU. By changing the adjacency values of each half-edge, the algorithm accomplish to unlink half-edges that are not used in the new polygonal mesh without the need neither removing nor allocating new memory in the GPU. The experimental results show a speedup, reaching up to $\times 83.2$ when compared to the CPU sequential implementation. Additionally, the speedup is $\times 746.8$ when the cost of copying the data structure from the host device and back is not included.
Explore related subjects
Keep this discovery
Sergio Salinas-Fernández, Nancy Hitschfeld-Kahler, Roberto Carrasco. 2024-03-20. GPolylla: Fully GPU-accelerated polygonal mesh generator. https://arxiv.org/abs/2403.14723
Cite the original work for its findings. Save a collection to share your selection of sources.