Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
From MaRDI portal
Cited in
(22)- A linear systolic algorithm for the connected component problem
- A class of problems efficiently solvable on mesh-connected computers including dynamic expression evaluation
- Computing convexity properties of images on a pyramid computer
- Processor-time optimal parallel algorithms for digitized images on mesh- connected processor arrays
- Computational geometry algorithms for the systolic screen
- Topological numbering of features on a mesh
- Optimal geometric algorithms for digitized images on fixed-size linear arrays and scan-line arrays
- Parallel asynchronous connected components in a mesh
- The calculation of average distance in mesh structures.
- Parallel geometric algorithms on a mesh-connected computer
- Fast connected-component labeling
- The balanced binary tree technique on mesh-connected computers
- Solving visibility problems on MCCs of smaller size
- New fast parallel algorithm for the connected component problem and its VLSI implementation
- TIME-OPTIMAL ALGORITHMS FOR GENERALIZED DOMINANCE COMPUTATION AND RELATED PROBLEMS ON MESH CONNECTED COMPUTERS AND MESHES WITH MULTIPLE BROADCASTING
- Computing minimum spanning forests on 1- and 2-dimensional processor arrays (extended abstract)
- Parallel computation of discrete Voronoi diagrams (extended abstract)
- Dynamic computational geometry on meshes and hypercubes
- Determining maximum \(k\)-width-connectivity on meshes
- Leftmost one computation on meshes with row broadcasting
- Graph algorithms on a tree-structured parallel computer
- Parallel general prefix computations with geometric, algebraic, and other applications
This page was built for publication: Finding Connected Components and Connected Ones on a Mesh-Connected Parallel Computer
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3893326)
