1993
Determining maximum k-width-connectivity on meshes
Publication
Publication
Computational Geometry , Volume 3 - Issue 2 p. 91- 105
Let I be a n × n binary image stored in a n × n mesh of processors with one pixel per processor. Image I is k-width-connected if, informally, between any pair of 1-pixels there exists a path of width k (composed of 1-pixels only). We consider the problem of determining the largest integer k such that I is k-width-connected, and present an optimal O(n) time algorithm for the mesh architecture.
| Additional Metadata | |
|---|---|
| binary images, connected components, k-width-connectivity, meshes, Parallel algorithms | |
| dx.doi.org/10.1016/0925-7721(93)90002-N | |
| Computational Geometry | |
| Organisation | School of Computer Science |
|
Hambrusch, S.E. (Susanne E.), & Dehne, F. (1993). Determining maximum k-width-connectivity on meshes. Computational Geometry, 3(2), 91–105. doi:10.1016/0925-7721(93)90002-N
|
|