Data-Parallel Mesh Connected Components Labeling and Analysis

dc.contributor.authorHarrison, Cyrusen_US
dc.contributor.authorChilds, Hanken_US
dc.contributor.authorGaither, Kelly P.en_US
dc.contributor.editorTorsten Kuhlen and Renato Pajarola and Kun Zhouen_US
dc.date.accessioned2014-01-26T16:57:07Z
dc.date.available2014-01-26T16:57:07Z
dc.date.issued2011en_US
dc.description.abstractWe 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.seriesinformationEurographics Symposium on Parallel Graphics and Visualizationen_US
dc.identifier.isbn978-3-905674-32-3en_US
dc.identifier.issn1727-348Xen_US
dc.identifier.urihttps://doi.org/10.2312/EGPGV/EGPGV11/131-140en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.5 [Computational Geometry and Object Modeling]: Geometric algorithms, languages, and systemsen_US
dc.titleData-Parallel Mesh Connected Components Labeling and Analysisen_US
Files
Original bundle
Now showing 1 - 1 of 1
Loading...
Thumbnail Image
Name:
131-140.pdf
Size:
646.47 KB
Format:
Adobe Portable Document Format