Data-Parallel Mesh Connected Components Labeling and Analysis
| dc.contributor.author | Harrison, Cyrus | en_US |
| dc.contributor.author | Childs, Hank | en_US |
| dc.contributor.author | Gaither, Kelly P. | en_US |
| dc.contributor.editor | Torsten Kuhlen and Renato Pajarola and Kun Zhou | en_US |
| dc.date.accessioned | 2014-01-26T16:57:07Z | |
| dc.date.available | 2014-01-26T16:57:07Z | |
| dc.date.issued | 2011 | en_US |
| dc.description.abstract | We present a data-parallel algorithm for identifying and labeling the connected sub-meshes within a domaindecomposed 3D mesh. The identification task is challenging in a distributed-memory parallel setting because connectivity is transitive and the cells composing each sub-mesh may span many or all processors. Our algorithm employs a multi-stage application of the Union-find algorithm and a spatial partitioning scheme to efficiently merge information across processors and produce a global labeling of connected sub-meshes. Marking each vertex with its corresponding sub-mesh label allows us to isolate mesh features based on topology, enabling new analysis capabilities. We briefly discuss two specific applications of the algorithm and present results from a weak scaling study. We demonstrate the algorithm at concurrency levels up to 2197 cores and analyze meshes containing up to 68 billion cells. | en_US |
| dc.description.seriesinformation | Eurographics Symposium on Parallel Graphics and Visualization | en_US |
| dc.identifier.isbn | 978-3-905674-32-3 | en_US |
| dc.identifier.issn | 1727-348X | en_US |
| dc.identifier.uri | https://doi.org/10.2312/EGPGV/EGPGV11/131-140 | en_US |
| dc.publisher | The Eurographics Association | en_US |
| dc.subject | Categories and Subject Descriptors (according to ACM CCS): I.3.5 [Computational Geometry and Object Modeling]: Geometric algorithms, languages, and systems | en_US |
| dc.title | Data-Parallel Mesh Connected Components Labeling and Analysis | en_US |
Files
Original bundle
1 - 1 of 1