Parallel algorithms for geometric connected component labeling on a hypercube multiprocessor
Parallel algorithms for the geometric connected component labeling (GCCL) problem on a hypercube multiprocessor can be designed by dividing the domain, consisting of a number of rectangles, into regions using a slice or rectangular partitioning scheme. Each processor in the hypercube is assigned one...
Saved in:
Published in | IEEE transactions on computers Vol. 41; no. 6; pp. 699 - 709 |
---|---|
Main Authors | , |
Format | Journal Article |
Language | English |
Published |
Legacy CDMS
IEEE
01.06.1992
Institute of Electrical and Electronics Engineers |
Subjects | |
Online Access | Get full text |
Cover
Loading…
Be the first to leave a comment!