Advertisement

Boundary File Generation from Octree Encoding

  • Kazunori Yamaguchi
  • Toshiaki Satoh
  • Tosiyasu L. Kunii

Abstract

This paper describes an algorithm for generating a boundary representation from an octree representation. This algorithm includes some useful algorithms, such as how to find cubes adjacent to a given cube in an octree.

Keywords

Target Node Adjacent Node Boundary Representation Tree Traversal Node Address 
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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    K. Yamaguchi, T. L. Kunii, K. Fujimura, and H. Toriya, “Octree Related Algorithms and Data Structures,” IEEE Computer Graphics and Applications, Jan., 1984, pp.53-59.Google Scholar
  2. 2.
    M. M. Yau and S. N. Srihari, “A Hierarchical Data Structure for Multidimensional Digital Images,” Comm. ACM., Vol. 26, No. 7, July, 1983, PP. 504–515.CrossRefGoogle Scholar
  3. 3.
    K. Yamaguchi, N. Inamoto, H. Kunii and T. L. Kunii, “Three-Dimensional Data Input by Selection of Hierarchically Defined Blocks,” submitted to Eurographics 84.Google Scholar
  4. 4.
    A. Baer, C. Eastman and M. Henrion, “Geometric modelling: a survey,” CAD Vol. 11, No. 5, Sept. 1979, pp. 253–272.Google Scholar

Copyright information

© Springer-Verlag Tokyo 1985

Authors and Affiliations

  • Kazunori Yamaguchi
    • 1
  • Toshiaki Satoh
    • 1
  • Tosiyasu L. Kunii
    • 1
  1. 1.Faculty of Science Department of Information ScienceThe University of TokyoBunkyo-ku, TokyoJapan

Personalised recommendations