Two Methodologies to Implement 3D Thinning Algorithms oh Distributed Memory Machines

摘要

Our goal is to implement skeletonization algorithms on distribution memory mechines. This implementation is not trivial, because we cannot apply locally thinning operators based on 26-neighborhood, sequentially or simultaneously on all the points of the image. After summarizing the problem, we describe two methodologies to implement these algorithms on MIMD machines, one based on the decomposition of the thinning operator into sub-operators, and the other based on the decomposition of the study domain (image) into sub-domains.