Share Email Print

Proceedings Paper

Volume Representation: Linear Octtrees From Three�Dimensional Arrays
Author(s): Tianwen Zhang; Zhongrong Li
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Many of the programming techniques used in solving two-dimensional problems can be extended to three-dimensions. Here a method is proposed for converting the three-dimensional array representation of an object into its linear octtree description. The method contains two algorithms: (1) conversion of three-dimensional array into set of 0-octants and (2) translation--merging of 0-octants encoded an object. For the three--dimensional array A = { a(i, j, k) I 0<i,j,k<2n-1} ,algorithm(1) requires 0(2 3n) time and algorithm (2) can be executed in linear time with respect to the total number of 0-octants.

Paper Details

Date Published: 1 February 1990
PDF: 10 pages
Proc. SPIE 1197, Automated Inspection and High-Speed Vision Architectures III, (1 February 1990); doi: 10.1117/12.969945
Show Author Affiliations
Tianwen Zhang, Harbin Institute of Technology (China)
Zhongrong Li, Harbin Institute of Technology (China)

Published in SPIE Proceedings Vol. 1197:
Automated Inspection and High-Speed Vision Architectures III
Michael J. W. Chen, Editor(s)

© SPIE. Terms of Use
Back to Top