A Hierarchical Data Structure for Representing the Spatial Decomposition of 3D Objects
A generalization of the octree data structure for representing polyhedral objects is described. This data structure, called the polytree, is a cellular spatial decomposition of the object space into primitive cells containing edge and vertex intersection information. The increased complexity of primitive cells results in several advantages over octrees, while, at the same time, retaining most of the desirable features of the octree structure. A recursive subdivision algorithm for the creation of a polytree from a boundary representation is presented.
KeywordsLeaf Node Object Space Leaf Cell Boundary Representation Edge Cell
Unable to display preview. Download preview PDF.
- 3.Fujimura, K. and T.L. Kunii, Personal Communication, Department of Information Science, The University of Tokyo, Japan (1984).Google Scholar
- 4.Hunter, G.M., Geometrees for Interactive Visualization of Geology: An Evaluation, Research Note, Schlumberger-Doll Research, Ridgefield, CT (April 1984).Google Scholar
- 10.Srihari, S.N., “Hierarchical Data Structures and Progressive Refinement of 3D Images,” Proc. IEEE Conference on Pattern Recognition and Image Processing, Las Vegas, NV (June 1982) 485-490.Google Scholar
- 11.Sutherland, I.E., SKETCHPAD: A Man-Machine Graphical Communication System, SJCC 1963, Spartan Books, Baltimore, Md, p. 329.Google Scholar
- 13.Vanderschel, D.J., Divided Leaf Octal Trees, Research Note, Schlumberger-Doll Research, Ridgefield, CT (March 1984).Google Scholar