Volume Representation: Linear Octtrees From ThreeÃ¢â‚¬â€?Dimensional Arrays

Tianwen Zhang; Zhongrong Li

doi:10.1117/12.969945

1 February 1990 Volume Representation: Linear Octtrees From Three-Dimensional Arrays

Tianwen Zhang, Zhongrong Li

Proceedings Volume 1197, Automated Inspection and High-Speed Vision Architectures III; (1990) https://doi.org/10.1117/12.969945
Event: 1989 Symposium on Visual Communications, Image Processing, and Intelligent Robotics Systems, 1989, Philadelphia, PA, United States

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.

Citation Download Citation

Tianwen Zhang and Zhongrong Li "Volume Representation: Linear Octtrees From Three-Dimensional Arrays", Proc. SPIE 1197, Automated Inspection and High-Speed Vision Architectures III, (1 February 1990); https://doi.org/10.1117/12.969945

ACCESS THE FULL ARTICLE

INSTITUTIONAL
Select your institution to access the SPIE Digital Library.

SELECT YOUR INSTITUTION

PERSONAL
Sign in with your SPIE account to access your personal subscriptions or to use specific features such as save to my library, sign up for alerts, save searches, etc.

PERSONAL SIGN IN

No SPIE Account? Create one

PURCHASE THIS CONTENT

SUBSCRIBE TO DIGITAL LIBRARY

50 downloads per 1-year subscription

Members: $195

Non-members: $335 ADD TO CART

25 downloads per 1 - year subscription

Members: $145

Non-members: $250 ADD TO CART

PURCHASE SINGLE ARTICLE

Includes PDF, HTML & Video, when available