A Hierarchical Data Structure for Representing the Spatial Decomposition of 3D Objects

  • Ingrid Carlbom
  • Indranil Chakravarty
  • David Vanderschel


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.


Leaf Node Object Space Leaf Cell Boundary Representation Edge Cell 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Clark, J.H., “Hierarchical Geometric Models for Visible Surface Algorithms,” Communications of the ACM 19, 10 (Oct. 1976) pp. 547–554.CrossRefMATHGoogle Scholar
  2. 2.
    Doctor, L.J., and J.G. Torborg, “Display Techniques for Octree-Encoded Objects,” IEEE Computer Graphics and Applications 1, 3 (July 1981) pp. 29–38.CrossRefGoogle Scholar
  3. 3.
    Fujimura, K. and T.L. Kunii, Personal Communication, Department of Information Science, The University of Tokyo, Japan (1984).Google Scholar
  4. 4.
    Hunter, G.M., Geometrees for Interactive Visualization of Geology: An Evaluation, Research Note, Schlumberger-Doll Research, Ridgefield, CT (April 1984).Google Scholar
  5. 5.
    Meagher, D., “Geometric Modeling Using Octree Encoding,” Computer Graphics and Image Processing, 19, (1982) pp. 129–147.CrossRefGoogle Scholar
  6. 6.
    Requicha, A.A.G., “Representations for Rigid Solids: Theory, Methods, and Systems,” Computing Surveys, 12, 4 (Dec. 1980) pp. 437–464.CrossRefGoogle Scholar
  7. 7.
    Roth, S.D., “Ray Casting for Modeling Solids,” Computer Graphics and Image Processing 18, 2 (Feb. 1982) pp. 109–144.CrossRefGoogle Scholar
  8. 8.
    Rubin, S.M. and T. Whitted, “A 3-Dimensional Representation for Fast Rendering of Complex Scenes,” Computer Graphics 14, 3 (July 1980) pp. 110–116.CrossRefGoogle Scholar
  9. 9.
    Srihari, S.N., “Representation of Three-Dimensional Digital Images,” Computing Surveys 13, 4 (1981) 399–424.CrossRefGoogle Scholar
  10. 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. 11.
    Sutherland, I.E., SKETCHPAD: A Man-Machine Graphical Communication System, SJCC 1963, Spartan Books, Baltimore, Md, p. 329.Google Scholar
  12. 12.
    Sutherland, I.E. and G.W. Hodgman, “Reentrant Polygon Clipping,” Communications of the ACM, 17, 1 (Jan. 1974) pp. 32–42.CrossRefMATHGoogle Scholar
  13. 13.
    Vanderschel, D.J., Divided Leaf Octal Trees, Research Note, Schlumberger-Doll Research, Ridgefield, CT (March 1984).Google Scholar

Copyright information

© Springer-Verlag Tokyo 1985

Authors and Affiliations

  • Ingrid Carlbom
    • 1
  • Indranil Chakravarty
    • 1
  • David Vanderschel
    • 2
  1. 1.Schlumberger-Doll ResearchRidgefieldUSA
  2. 2.Schlumberger-AECAustinUSA

Personalised recommendations