(in WR Franklin → Research)

This is a better method for creating octrees by a bottom-up approach instead of using top-down subdivision. The idea is to intersect 1-D rays with the object, split the part of each ray that is inside the object into bintrees, group adjacent bintrees into quadtrees, then group adjacent quadtrees into octrees. This whole process has a systolic computation flavor. The advantage of this method is that it is easier to intersect the object with a line than with a cube. (1985)

1. . Wm Randolph Franklin and Varol Akman. IEEE Computer Graphics and Applications, 5(10):58-64, oct 1985. (paper).
2. . Wm Randolph Franklin and Varol Akman, Octree Data Structures and Creation by Stacking. In Computer Generated Images, State of the ArtSpringer-Verlag, 1985. (paper).
3. . Wm Randolph Franklin and Varol Akman. In Graphics Interface, 1985. (paper).
4. . Varol Akman and Wm Randolph Franklin. Computers and Graphics, 13(3):373-379, 1989. (paper).
5. . Varol Akman and Wm Randolph Franklin. Pattern Recognition Letters, Nov 1989. (paper).

<< Union | Research Page List | Expert System Sensitivity Analysis >>