Publication 1995 Issue No. 1 - January Abstract - Parallel Display of Objects Represented by Linear Octrees
Parallel Display of Objects Represented by Linear Octrees
January 1995 (vol. 6 no. 1)
pp. 79-85
 ASCII Text x Djaffer Ibaroudene, Raj Acharya, "Parallel Display of Objects Represented by Linear Octrees," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 1, pp. 79-85, January, 1995.
 BibTex x @article{ 10.1109/71.363409,author = {Djaffer Ibaroudene and Raj Acharya},title = {Parallel Display of Objects Represented by Linear Octrees},journal ={IEEE Transactions on Parallel and Distributed Systems},volume = {6},number = {1},issn = {1045-9219},year = {1995},pages = {79-85},doi = {http://doi.ieeecomputersociety.org/10.1109/71.363409},publisher = {IEEE Computer Society},address = {Los Alamitos, CA, USA},}
 RefWorks Procite/RefMan/Endnote x TY - JOURJO - IEEE Transactions on Parallel and Distributed SystemsTI - Parallel Display of Objects Represented by Linear OctreesIS - 1SN - 1045-9219SP79EP85EPD - 79-85A1 - Djaffer Ibaroudene, A1 - Raj Acharya, PY - 1995VL - 6JA - IEEE Transactions on Parallel and Distributed SystemsER -

Abstract—The storage, display, and manipulation of three dimensional volumetrique information requires a large amounts of computing resources, both in terms of memory, and processing power. Most existing serial algorithms that display 3-D objects on a 2-D screen are found to be too slow to process the large amounts of volume data in a reasonable time. Hence, one way to increase the performance of the display algorithm is to process individual volume elements (voxels) in parallel. The first part of this paper presents a brief overview of the linear octree [6] data structure which represents 3-D objects by an eight-way branching tree, while the second part focusses on the parallel display of such objects. We have shown that, for an object represented by a linear octree and enclosed in a $2^n\times2^n\times2^n$ universe, the maximum number of voxels that can be processed in parallel is $3^n$, and the maximum number of time steps required to display such an object is $4^n$. This paper presents a set of formulae which identify the processing element (PE) as well as the time step in which a given linear octree node is processed. Similarly, a procedure which determines the locational code of a linear octree node which must be processed by a given PE, at some specific time step, is presented, along with a strategy for determining whether a PE is active or idle.

Index Terms—Linear octree, octree, parallel 3-D display, back-to-front projections, volume rendering.

[1] L. T. Cook, S. J. Dwyer, S. Batnitsky, and K. R. Lee,“A three-dimensional display system for diagnostic imaging application,”IEEE Comput. Graphics, Applicat., vol. 3, no. 5, pp. 13–19, Aug. 1983.
[2] S. M. Goldwasser and R. A. Reynolds,“Real time display and manipulation of 3-D medical objects: The voxel processor architecture,”Comput. Vision, Graphics, Image Processing, vol. 39, pp. 1–27, 1987.
[3] S. N. Srihari,“Representation of three-dimensional digital images,”ACM Computing Surveys, vol. 13, no. 1, pp. 399–424, Dec. 1981.
[4] R. A. Reynolds,“Fast methods for 3-D display of medical objects,”Ph.D. dissertation, University of Pennsylvania, Philadelphia, 1985.
[5] V. Akman and W. R. Franklin,“Representing objects as rays, or how to pile up an octree?”Comput., Graphics, vol. 13, no. 3, pp. 373–379, 1989.
[6] I. Gargantini,“Linear octrees for fast processing of three-dimensional objects,”Comput. Graphics, Image Processing, vol. 20, no. 4, pp. 365–374, 1982.
[7] H. Samet,“The quadtree and related hierarchical data structures,” ACM Computing Surveys, vol. 16, no. 2, pp. 187-260, June 1984.
[8] H. Samet and R. E. Webber,“Hierarchical data structures and algorithms for computer graphics, Part I: Fundamentals,”IEEE Comput. Graphics, Applicat., pp. 48–68, May 1988.
[9] H. Samet and R. E. Webber,“Hierarchical data structures and algorithms for computer graphics, Part II: Applications,”IEEE Comput. Graphics, Applicat., pp. 59–75, July 1988.
[10] D. Ibaroudene, V. Demjanenko, and R. Acharya,“Adjacency algorithms for linear octree nodes,”Image, Vision Computing, vol. 8, no. 2, pp. 115–123, May 1990.

Citation:
Djaffer Ibaroudene, Raj Acharya, "Parallel Display of Objects Represented by Linear Octrees," IEEE Transactions on Parallel and Distributed Systems, vol. 6, no. 1, pp. 79-85, Jan. 1995, doi:10.1109/71.363409