Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Practical parallel union-find algorithms for transitive closure and clustering
International Journal of Parallel Programming
Wait-free parallel algorithms for the union-find problem
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
An introduction to parallel algorithms
An introduction to parallel algorithms
Parallel Architectures and Algorithms for Image Component Labeling
IEEE Transactions on Pattern Analysis and Machine Intelligence
An efficient and fast parallel-connected component algorithm
Journal of the ACM (JACM)
The design and implementation of an object-oriented toolkit for 3D graphics and visualization
Proceedings of the 7th conference on Visualization '96
Efficiency of a Good But Not Linear Set Union Algorithm
Journal of the ACM (JACM)
Computing contour trees in all dimensions
SODA '00 Proceedings of the eleventh annual ACM-SIAM symposium on Discrete algorithms
Introduction to Algorithms
Handbook of Computer Vision Algorithms in Image Algebra
Handbook of Computer Vision Algorithms in Image Algebra
IPPS '92 Proceedings of the 6th International Parallel Processing Symposium
Asynchronous Parallel Construction of Recursive Tree Hierarchies
ParNum '99 Proceedings of the 4th International ACPC Conference Including Special Tracks on Parallel Numerics and Parallel Computing in Image Processing, Video Processing, and Multimedia: Parallel Computation
A Parallel Algorithm for Connected Components on Distributed Memory Machines
Proceedings of the 8th European PVM/MPI Users' Group Meeting on Recent Advances in Parallel Virtual Machine and Message Passing Interface
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Interval volume: a solid fitting technique for volumetric data display and analysis
VIS '95 Proceedings of the 6th conference on Visualization '95
Efficient algorithms for graph manipulation
Efficient algorithms for graph manipulation
Loop surgery for volumetric meshes: Reeb graphs reduced to contour trees
IEEE Transactions on Visualization and Computer Graphics
Extreme Scaling of Production Visualization Software on Diverse Architectures
IEEE Computer Graphics and Applications
Parallel and Streaming Generation of Ghost Data for Structured Grids
IEEE Computer Graphics and Applications
A scalable parallel union-find algorithm for distributed memory computers
PPAM'09 Proceedings of the 8th international conference on Parallel processing and applied mathematics: Part I
| Hi-index | 0.00 |
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.