Connectivity-preserving parallel operators in 2D and 3D images
Richard Whit Hall · Proceedings of SPIE, the International Society for Optical Engineering/Proceedings of SPIE · 1993
Connectivity preservation is a concern in the design of parallel reduction processes for 2D and 3D image processing algorithms. Algorithm designers need efficient and available connectivity preservation tasks to prove algorithm correctness. Although efficient 2D tests are known, efficient 3D tests still need to be developed. We review earlier results for 2D connectivity preservation tests and demonstrate several 'design spaces' for classes of parallel reduction operators including subiteration and subfields approaches. We then extend certain 'path based' tests from the 2D to the 3D case and show efficient realizations for all but one test for fully parallel reduction operators. Very efficient tests are determined for 3D subfields reduction operators.