Rights accessRestricted access - publisher's policy
An image is a discrete array whose elements, called points, represent some property. Images are broadly used in computer graphics. In 2D graphics applications, color, depth and other image properties are
frequently used. In 3D graphics, a solid may be represented by a 3D binary image whose elements have value 0 or 1 indicating absence or presence of solid. Similarly, many volume applications use non-binary
3D images to represent some spatial function.
Here we propose an algorithm to solve the connectivity problem, which can be stated as follows: given an n-dimensional image I, an m-adjacency A and a predicate P which segments the property values into black and white points, check if the black points of I are m-connected, that is, if I has a single m-connected black component.
CitationAndújar, C. Space efficient connectivity test for n-dimensional images. "Computers and graphics (UK)", Agost 1998, vol. 22, núm. 4, p. 557-558.
All rights reserved. This work is protected by the corresponding intellectual and industrial property rights. Without prejudice to any existing legal exemptions, reproduction, distribution, public communication or transformation of this work are prohibited without permission of the copyright holder. If you wish to make any use of the work not provided for in the law, please contact: email@example.com