Parallel manipulations of octrees and quadtrees

  • Vipin Chaudhary
  • K. Kamath
  • P. Arunachalam
  • J. K. Aggarwal
Part of the Lecture Notes in Computer Science book series (LNCS, volume 654)


Octrees offer a powerful means for representing and manipulating 3-D objects. This paper presents an implementation of octree manipulations using a new approach on a shared memory architecture. Octrees are hierarchical data structures used to model 3-D objects. The manipulation of these data structures involves performing independent computations on each node of the octree. Octrees are much easier to deal with than other forms of representations used to model 3-D objects especially where extensive manipulations are involved. When these operations are distributed among multiple processing elements (PEs) and executed simultaneously, a significant speedup may be achieved. Manipulations such as a complement, a union, an intersection and other operations such as finding the volume and centroid which this paper describes are implemented on the Sequent Balance multiprocessor. In this approach the PEs are allocated dynamically, resulting in a uniform load balancing among them. The experimental results presented illustrate the feasibility of the approach. Although this evaluation has been originally done for shared memory machines, it will provide insight for the evaluation on other architectures.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Chien, C. H., Aggarwal, J. K.: Volume/surface octrees for the representation of three-dimensional objects. Computer Vision, Graphics and Image Processing. 36 (1986) 100–113Google Scholar
  2. 2.
    Chien, C. H., Aggarwal, J. K.: Reconstruction and matching of 3D objects using quadtrees/octrees. Proceedings of 3rd Workshop on Computer Vision. (1985) 49–54Google Scholar
  3. 3.
    Chen, H. H., Huang, T. S.: A survey of the construction and manipulation of octrees. Computer Vision, Graphics and Image Processing. 43 (1988) 409–431Google Scholar
  4. 4.
    Schneier, M.: Calculations of geometric properties using quadtrees. Computer Graphics and Image Processing. 16 (1981) 296–302CrossRefGoogle Scholar
  5. 5.
    Meagher, D. J. R.: The octree encoding method for efficient solid modeling. Ph. D. dissertation, Electrical and Systems Engineering Department, Rensselaer Polytechnic Institute, Troy, New York 12181.Google Scholar
  6. 6.
    Jackins, C. L., Tanimoto, S. L.: Quad-trees, oct-trees and K-trees: a generalized approach to recursive decomposition of euclidean space. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-5 (1983) 533–539Google Scholar
  7. 7.
    Doctor, L. J., Torborg, J. G.: Display techniques for octree-encoded objects. IEEE Comput. Graphics Appl. 3 (1981) 29–40Google Scholar
  8. 8.
    Samet, H.: A top-down quadtree traversal algorithm. IEEE Trans. Pattern anal. Mach. Intell. PAMI-7 (1985) 94–98Google Scholar
  9. 9.
    Moitra, A., Iyengar, S. S.: Parallelism from recursive programs. Advances in Computers. June (1986)Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1992

Authors and Affiliations

  • Vipin Chaudhary
    • 1
  • K. Kamath
    • 2
  • P. Arunachalam
    • 3
  • J. K. Aggarwal
    • 3
  1. 1.Department of Electrical and Computer EngineeringWayne State UniversityDetroitUSA
  2. 2.Sun MicrosystemsSan JoseUSA
  3. 3.Department of Electrical and Computer EngineeringThe University of Texas at AustinAustinUSA

Personalised recommendations