An Approximation To The 3D Border (A3DB)

Irene Gargantini; George Lam

doi:10.1117/12.935284

26 October 1983 An Approximation To The 3D Border (A3DB)

Irene Gargantini, George Lam

Proceedings Volume 0397, Applications of Digital Image Processing V; (1983) https://doi.org/10.1117/12.935284
Event: 1983 International Technical Conference/Europe, 1983, Geneva, Switzerland

Abstract

Linear octtrees have been introduced recently1 as a data structure capable of compacting the ten fields normally required by an octtree's node into one. Operations like projection, superposition, adjacency, mapping from and to a 2n x 2n x 2n-digital array have also been described in the above reference. In this paper the authors propose an approximate solution to the determination of the 3D border of an object represented by a linear octtree. The corresponding algorithm is shown to be executable in O(nN) time and to require less than 4N memory locations, where N is the number of black nodes of the linear octtree, and n is the resolution of the binary image.

Citation Download Citation

Irene Gargantini and George Lam "An Approximation To The 3D Border (A3DB)", Proc. SPIE 0397, Applications of Digital Image Processing V, (26 October 1983); https://doi.org/10.1117/12.935284

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