Improvements to a recent 3d-border algorithm

Abstract A linear oct-tree can be mapped into its three-dimensional border-representation by the repeated elimination of the internal boundaries existing between any two nodes. This paper shows that such a mapping can be efficiently implemented by a recursive algorithm in a single pass through the input data. Among the advantages of the procedure presented here with respect to the algorithm previously introduced by the authors are the elimination of costly dynamic insertions and deletions, the reduction of memory requirements and the search of smaller arrays.

[1]  Neil E. Wiseman,et al.  Operations on Quadtree Encoded Images , 1983, Comput. J..

[2]  Irene Gargantini,et al.  Translation, Rotation and Superposition of Linear Quadtrees , 1983, Int. J. Man Mach. Stud..

[3]  Chris L. Jackins,et al.  Oct-trees and their use in representing three-dimensional objects , 1980 .

[4]  Azriel Rosenfeld,et al.  Region representation: boundary codes from quadtrees , 1980, CACM.

[5]  Michael L. Rhodes,et al.  Organization and Access of Image Data by Areas , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6]  Irene Gargantini,et al.  Linear quadtrees: A blocking technique for contour filling , 1984, Pattern Recognit..

[7]  Kenneth Steiglitz,et al.  Operations on Images Using Quad Trees , 1979, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[8]  Irene Gargantini,et al.  Counting regions, holes, and their nesting level in time proportional to the border , 1984, Comput. Vis. Graph. Image Process..

[9]  Michael Shneier,et al.  Path-Length distances for quadtrees , 1981, Inf. Sci..

[10]  D. J. Abel,et al.  A B+-tree structure for large quadtrees , 1983, Comput. Vis. Graph. Image Process..

[11]  Gabor T. Herman,et al.  The theory, design, implementation and evaluation of a three-dimensional surface detection algorit , 1981 .

[12]  Hanan Samet,et al.  An Algorithm for Converting Rasters to Quadtrees , 1981, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[13]  Irene Gargantini,et al.  Linear octtrees for fast processing of three-dimensional objects , 1982, Comput. Graph. Image Process..

[14]  Sargur N. Srihari,et al.  Boundary Detection in Multidimensions , 1982, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[15]  Hsun K. Liu,et al.  Two and three dimensional boundary detection , 1977 .

[16]  Hanan Samet,et al.  Region representation: quadtrees from boundary codes , 1980, CACM.

[17]  Michael Anthony Bauer,et al.  Set operations on linear quadtrees , 1984, Comput. Vis. Graph. Image Process..

[18]  Donald Ervin Knuth,et al.  The Art of Computer Programming , 1968 .

[19]  Sargur N. Srihari,et al.  Representation of Three-Dimensional Digital Images , 1981, CSUR.

[20]  Hanan Samet,et al.  Connected Component Labeling Using Quadtrees , 1981, JACM.

[21]  Irene Gargantini,et al.  Filling by quadrants or octants , 1986, Comput. Vis. Graph. Image Process..

[22]  J. L. Smith,et al.  A data structure and algorithm based on a linear key for a rectangle retrieval problem , 1983, Comput. Vis. Graph. Image Process..

[23]  J. R. Woodward,et al.  The Explicit Quad Tree as a Structure for Computer Graphics , 1982 .