论文信息 - Building an Octree from a Set of Parallelepipeds - 字舞流文

Building an Octree from a Set of Parallelepipeds

What do you call an algorithm designed to stack things up to build larger things? Why, STACK, of course.

Varol Akman | W. Randolph Franklin

[1] Donald Meagher,et al. Geometric modeling using octree encoding , 1982, Comput. Graph. Image Process..

[2] Sargur N. Srihari,et al. Representation of Three-Dimensional Digital Images , 1981, CSUR.

[3] Hanan Samet,et al. Efficient octree conversion by connectivity labeling , 1984, SIGGRAPH.

[4] Sargur N. Srihari,et al. A hierarchical data structure for multidimensional digital images , 1983, CACM.

[5] Steven L. Tanimoto,et al. Quad-Trees, Oct-Trees, and K-Trees: A Generalized Approach to Recursive Decomposition of Euclidean Space , 1983, IEEE Transactions on Pattern Analysis and Machine Intelligence.

[6] Robert E. Tarjan,et al. Data structures and network algorithms , 1983, CBMS-NSF regional conference series in applied mathematics.

[7] Chris L. Jackins,et al. Oct-trees and their use in representing three-dimensional objects , 1980 .

[8] N SrihariSargur. Representation of Three-Dimensional Digital Images , 1981 .

[9] Gaston H. Gonnet,et al. Handbook Of Algorithms And Data Structures , 1984 .

[10] Doctor,et al. Display Techniques for Octree-Encoded Objects , 1981, IEEE Computer Graphics and Applications.

[11] Tosiyasu L. Kunii,et al. Octree-Related Data Structures and Algorithms , 1984, IEEE Computer Graphics and Applications.

[12] Hanan Samet,et al. Region representation: quadtrees from boundary codes , 1980, CACM.