
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Hanan Samet, Robert E. Webber, "Hierarchical Data Structures and Algorithms for Computer Graphics. Part I.," IEEE Computer Graphics and Applications, vol. 8, no. 3, pp. 4868, May/June, 1988.  
BibTex  x  
@article{ 10.1109/38.513, author = {Hanan Samet and Robert E. Webber}, title = {Hierarchical Data Structures and Algorithms for Computer Graphics. Part I.}, journal ={IEEE Computer Graphics and Applications}, volume = {8}, number = {3}, issn = {02721716}, year = {1988}, pages = {4868}, doi = {http://doi.ieeecomputersociety.org/10.1109/38.513}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  MGZN JO  IEEE Computer Graphics and Applications TI  Hierarchical Data Structures and Algorithms for Computer Graphics. Part I. IS  3 SN  02721716 SP48 EP68 EPD  4868 A1  Hanan Samet, A1  Robert E. Webber, PY  1988 VL  8 JA  IEEE Computer Graphics and Applications ER   
The fundamentals of hierarchical data structures are reviewed and it is shown how they are used in the implementation of some basic operations in computer graphics. The properties of hierarchical structures are discussed, focusing on quadtrees and octrees. The latter are defined, some of the more common ways in which they are implemented are examined, and an explanation of the quadtree/octree complexity theorem is provided. Vector quadtrees and vector octrees are discussed. The performance of basic operations using quadtrees is considered.
1. I.E. Sutherland, R.F. Sproull, and R.A. Schumacker, "A Characterization of Ten Hidden Surface Algorithms,"Computing Surveys, Vol. 6, No. 1, Mar. 1974, pp. 155.
2. B.G. Baumgart, "Winged Edge Polyhedron Representation," Stanford Artificial Intelligence Lab., Memo AIM179 and Stanford Univ. Computer Science Report No. STANCS320, Oct. 1972.
3. J.H. Clark, "Hierarchical Geometric Models for Visible Surface Algorithms,"CACM, Oct. 1976, pp. 547554.
4. H. Samet and R.E. Webber, "Hierarchical Data Structures and Algorithms for Computer Graphics, Part II: Applications," To appear inCG&A, July 1988.
5. H. Samet, "The quadtree and related hierarchical data structures,"Comput. Surveys, vol. 16, pp. 187260, 1984.
6. H. Samet, "Bibliography on Quadtrees and Related Hierarchical Data Structures," inData Structures for Raster Graphics, F.J. Peters, L.R.A. Kessener, and M.L.P. van Lierop, eds., SpringerVerlag, Berlin, 1986, pp. 181201.
7. H. Samet,Spatial Data Structures: Quadtrees, Octrees, and Other Hierarchical Methods, to appear, 1989.
8. H. A. Simon,The Sciences of the Artificial, 2nd ed. Cambridge, MA: MIT Press, 1981.
9. I.E. Sutherland, "Sketchpad, A ManMachine Communication System,"Proc. SJCC, Detroit, 1963, pp. 329346.
10. J.C. Gray, "Compound Data Structure for Computer Aided Design: A Survey,"Proc. 22nd Nat'l Conf. ACM, ACM, New York, 1967, pp. 355365.
11. K.A. Lantz and W.I. Nowicki, "Structured Graphics for Distributed Systems,"ACM Trans. Graphics, Vol. 3, No. 1, Jan. 1984, pp. 2351.
12. American National Standards Institute Committee X3H31, American National Standard for the Functional Specification of the Programmer's Hierarchical Interactive Graphics System (PHIGS), ANSI Standard X3H31/8505 X3H3/8521, American National Standards Institute, New York, 1985.
13. D. F. Rogers,Procedural Elements for Computer Graphics. New York: McGrawHill, 1985.
14. S.M. Rubin and T. Whitted, "A 3D Representation for Fast Rendering of Complex Scenes,"Computer Graphics(Proc. Siggraph), Vol. 14, No. 3, July 1980, pp. 110116.
15. H. Weghorst, G. Hooper, and D.P. Greenberg, "Improved Computational Methods for Ray Tracing,"ACM Trans. Graphics, Jan. 1984, pp. 5269.
16. H. Fuchs, G. Abram, and E.D. Grant, "Near RealTime Shade Display of Rigid Objects,"Computer Graphics(Proc. Siggraph), Vol. 17, No. 3, July 1983, pp. 6572.
17. D.H. Ballard, "Strip Trees: A Hierarchical Representation for Curves,"CACM, May 1981, pp. 310321 (see also corrigendum,CACM, Mar. 1982, pp. 213).
18. N. Ahuja, "On Approaches to Polygonal Decomposition for Hierarchical Image Representation,"Computer Vision, Graphics, and Image Processing, Nov. 1983, pp. 200214.
19. S.B.M. Bell, B.M. Diaz, F. Holroyd, and M.J. Jackson, "Spatially Referenced Methods of Processing Raster and Vector Data,"Image and Vision Computing, Nov. 1983, pp. 211220.
20. L. Gibson and D. Lucas, "Vectorization of Raster Images Using Hierarchical Methods,"Computer Graphics and Image Processing, Sept. 1982, pp. 8289.
21. A. Klinger, "Patterns and Search Statistics," inOptimizing Methods in Statistics, J.S. Rustagi, ed., Academic Press, New York, 1971, pp. 303337.
22. H. Samet, A. Rosenfeld, C.A. Shaffer, and R.E. Webber, "A Geographic Information System Using Quadtrees,"Pattern Recognition, Nov./Dec. 1984, pp. 647656.
23. C.A. Shaffer, H. Samet, and R.C. Nelson, "QUILT: A Geographic Information System Based on Quadtrees," Tech. Report TR1885, Computer Science Dept., Univ. of Maryland, College Park, Md., 1987.
24. M. Shneier, "Two Hierarchical Linear Feature Representations: Edge Pyramids and Edge Quadtrees,"Computer Graphics and Image Processing, Nov. 1981, pp. 211224.
25. D. Ayala, P. Brunet, R. Juan, and I. Navazo, "Object Representation by Means of Nonminimal Division Quadtrees and Octrees,"ACM Trans. Graphics, Jan. 1985, pp. 4159.
26. J.E. Warnock, "A Hidden Surface Algorithm for Computer Generated Half Tone Pictures," Tech. Report TR 415, Computer Science Dept., Univ. of Utah, Salt Lake City, 1969.
27. G.M. Hunter, "Efficient Computation and Data Structures for Graphics," doctoral dissertation, Princeton Univ., Princeton, N.J., 1978.
28. C.L. Jackins and S.L. Tanimoto, "OctTrees and Their Use in Representing ThreeDimensional Objects,"Computer Graphics and Image Processing, Nov. 1980, pp. 249270.
29. D. Meagher, "Geometric Modeling Using Octree Encoding,"Computer Graphics and Image Processing, June 1982, pp. 129147.
30. D.R. Reddy and S. Rubin, "Representation of ThreeDimensional Objects," Tech. Report CMUCS78113, Computer Science Dept., Carnegie Mellon Univ., Pittsburgh, 1978.
31. D. E. Knuth,The Art of Computer Programming, Vol. 1. Reading, MA: AddisonWesley, 1973.
32. G.M. Hunter and K. Steiglitz, "Operations on Images Using Quad Trees,"IEEE Trans. Pattern Analysis and Machine Intelligence, Apr. 1979, pp. 145153.
33. E. Kawaguchi and T. Endo, "On a Method of Binary Picture Representation and Its Application to Data Compression,"IEEE Trans. Pattern Analysis and Machine Intelligence, Jan. 1980, pp. 2735.
34. E. Kawaguchi, T. Endo, and M. Yokota, "DFExpression of BinaryValued Picture and Its Relation to Other Pyramidal Representations,"Proc. Fifth Int'l Conf. Pattern Recognition, CS Press, Los Alamitos, Calif., 1980, pp. 822827.
35. E. Kawaguchi, T. Endo, and J. Matsunaga, "DepthFirst Expression Viewed from Digital Picture Processing,"IEEE Trans. Pattern Analysis and Machine Intelligence, July 1983, pp. 373384.
36. M.A. Oliver and N.E. Wiseman, "Operations on QuadtreeEncoded Images,"Computer J., Feb. 1983, pp. 8391.
37. M.A. Oliver and N.E. Wiseman, "Operations on Quadtree Leaves and Related Image Areas,"Computer J., Nov. 1983, pp. 375380.
38. G.M. Morton, "A Computer Oriented Geodetic Data Base and a New Technique in File Sequencing," IBM Ltd., Ottawa, Canada, 1966.
39. I. Gargantini, "An Effective Way to Represent Quadtrees,"CACM, Dec. 1982, pp. 905910.
40. I. Gargantini, "Linear Octtrees for Fast Processing of ThreeDimensional Objects,"Computer Graphics and Image Processing, Dec. 1982, pp. 365374.
41. I. Gargantini, "Detection of Connectivity for Regions Represented by Linear Quadtrees,"Computers and Mathematics with Applications, Vol. 8, No. 4, 1982, pp. 319327.
42. I. Gargantini, "Translation, Rotation, and Superposition of Linear Quadtrees,"Int'l J. ManMachine Studies, Mar. 1983, pp. 253263.
43. D. Rutovitz, "Data Structures for Operations on Digital Images," inPictorial Pattern Recognition, G.C. Cheng et al., eds., Thompson Book Co., Washington, D.C., 1968, pp. 105133.
44. J.P. Lauzon, D.M. Mark, L. Kikuchi, and J.A. Guevara, "TwoDimensional RunEncoding for Quadtree Representation,"Computer Vision, Graphics, and Image Processing, Apr. 1985, pp. 5669.
45. H. Samet and R.E. Webber, "A Comparison of the Space Requirements of MultiDimensional QuadtreeBased File Structures" Tech. Report TR1711, Computer Science Dept., Univ. of Maryland, College Park, Md., 1986.
46. K. Knowlton, "Progressive Transmission of GreyScale and Binary Pictures by Simple, Efficient, and Lossless Encoding Schemes,"Proc. IEEE, July 1980, pp. 885896.
47. M. Tamminen, "Comment on Quad and Octtrees,"CACM, Mar. 1984, pp. 248249.
48. H. Samet and M. Tamminen, "Efficient Component Labeling of Images of Arbitrary Dimension," Tech. Report TR1480, Computer Science Dept., Univ. of Maryland, College Park, Md., 1985. Also to be published inIEEE Trans. Pattern Analysis and Machine Intelligence.
49. C.R. Dyer, "The Space Efficiency of Quadtrees,"Computer Graphics and Image Processing, Aug. 1982, pp. 335348.
50. D. Meagher, "Octree Encoding: A New Technique for the Representation, the Manipulation, and Display of Arbitrary 3D Objects by Computer," Tech. Report IPLTR80111, Image Processing Laboratory, Rensselaer Polytechnic Inst., Troy, N.Y., 1980.
51. H. Samet and R.E. Webber, "Storing a Collection of Polygons Using Quadtrees,"ACM Trans. Graphics, July 1985, pp. 182222. Also published inProc. IEEE Computer Vision and Pattern Recognition Conf., CS Press, Los Alamitos, Calif., 1983, pp. 127132.
52. R.C. Nelson and H. Samet, "A Consistent Hierarchical Representation for Vector Data,"Computer Graphics(Proc. SIGGRAPH), Aug. 1986, pp. 197206.
53. H. Samet, C.A. Shaffer, and R.E. Webber, "Digitizing the Plane with Cells of NonUniform Size,"Information Processing Letters, Apr. 1987, pp. 369375.
54. A.S. Glassner, "Space Subdivision for Fast Ray Tracing,"CG&A, Oct. 1984, pp. 1522.
55. G. Wyvill and T.L. Kunii, "A Functional Model for Constructive Solid Geometry,"The Visual Computer, July 1985, pp. 314.
56. F.W. Jansen, "Data Structures for Ray Tracing," inData Structures for Raster Graphics, F.J. Peters, L.R.A. Kessener, and M.L.P. van Lierop, eds., SpringerVerlag, Berlin, 1986, pp. 5773.
57. M.R. Kaplan, "SpaceTracing: A Constant Time RayTracer,"Uses of Spatial Coherence in RayTracing, tutorial notes, SIGGRAPH 85, ACM, New York, 1985.
58. I. Carlbom, I. Chakravarty, and D. Vanderschel, "A Hierarchical Data Structure for Representing the Spatial Decomposition of 3D Objects,"CG&A, Apr. 1985, pp. 2431.
59. K. Fujimura and T.L. Kunii, "A Hierarchical Space Indexing Method,"Proc. Computer Graphics 85, SpringerVerlag, Tokyo, 1985, pp. 2133.
60. K.M. Quinlan and J.R. Woodwark, "A SpatiallySegmented Solids DatabaseJustification and Design,"Proc. CAD 82 Conf., Brighton, UK, 1982, pp. 126132.
61. D.J. Vanderschel, "Divided Leaf Octal Trees," research note, SchlumbergerDoll Research, Ridgefield, Conn., 1984.
62. I. Navazo,Contribucio a les tecniques de modelat geometric d'objectes poliedrics usant la codificacio amb arbres octals, doctoral dissertation, Escola Tecnica Superior d'Enginyers Industrials, Universitat Politechnica de Barcelona, Barcelona, Spain, 1986.
63. A. Fujimoto, T. Tanaka, and K. Iawata, "ARTS: Accelerated Ray Tracing System,"IEEE CG&A, Vol. 6, No. 4, April 1986, pp. 1626.
64. I. Navazo, D. Ayala, and P. Brunet,A Geometric Modeller Based on the Exact Octree Representation of Polyhedra, Escola Tecnica Superior d'Enginyers Industrials, Universitat Politechnica de Barcelona, Barcelona, Spain, 1986.
65. D.J. Abel and J.L. Smith, "A Simple Approach to the NearestNeighbor Problem,"Australian Computer J., Nov. 1984, pp. 140146.
66. D.P. Anderson, "Techniques for Reducing Pen Plotting Time,"ACM Trans. Graphics, July 1983, pp. 197212.
67. G.M. Hunter and K. Steiglitz, "Linear Transformation of Pictures Represented by Quad Trees,"Computer Graphics and Image Processing, July 1979, pp. 289296.
68. M. Shneier, "Calculations of Geometric Properties Using Quadtrees,"Computer Graphics and Image Processing, July 1981, pp. 296302.
69. F.J. Peters, "An Algorithm for Transformations of Pictures Represented by Quadtrees,"Computer Vision, Graphics, and Image Processing, Dec. 1985, pp. 397403.
70. N. Ahuja and C. Nash, "Octree Representations of Moving Objects,"Computer Vision, Graphics, and Image Processing, May 1984, pp. 207216.
71. W. Osse and N. Ahuja, "Efficient Octree Representation of Moving Objects,"Proc. Seventh Int'l Conf. Pattern Recognition, CS Press, Los Alamitos, Calif., 1984, pp. 821823.
72. J. Weng and N. Ahuja, "Octrees of Objects in Arbitrary Motion: Representation and Efficiency,"Computer Vision, Graphics, and Image Processing, Aug. 1987, pp. 167185.
73. M.L.P. van Lierop, "Geometrical Transformations on Pictures Represented by Leafcodes,"Computer Vision, Graphics, and Image Processing, Jan. 1986, pp. 8198.
74. T.R. Walsh, "Efficient AxisTranslation of Binary Digital Pictures by Blocks in Linear Quadtree Representation,"Computer Vision, Graphics, and Image Processing, Mar. 1988, pp. 282292.
75. K. Yamaguchi, T.L. Kunii, K. Fujimura, and H. Toriya, "OctreeRelated Data Structures and Algorithms,CG&A, Jan. 1984, pp. 5359.
76. F.S. Hill, Jr., S. Walker, Jr., and F. Gao, "Interactive Image Query System Using Progressive Transmission,"Computer Graphics(Proc. SIGGRAPH), July 1983, pp. 323330.
77. H. Samet, "Data Structures for Quadtree Approximation and Compression,"CACM, Sept. 1985, pp. 973993.
78. K.R. Sloan, Jr., and S.L. Tanimoto, "Progressive Refinement of Raster Images,"IEEE Trans. Computers, Nov. 1979, pp. 871874.
79. A. Klinger and M.L. Rhodes, "Organization and Access of Image Data by Areas,"IEEE Trans. Pattern Analysis and Machine Intelligence, Jan. 1979, pp. 5060.
80. H. Samet, "Neighbor Finding Techniques for Images Represented by Quadtrees,"Computer Graphics and Image Processing, Jan. 1982, pp. 3757.
81. H. Samet and C.A. Shaffer, "A Model for the Analysis of Neighbor Finding in PointerBased Quadtrees,"IEEE Trans. Pattern Analysis and Machine Intelligence, Nov. 1985, pp. 717720.
82. H. Samet, "Neighbor Finding in Images Represented by Octrees," Tech. Report. TR1968, Computer Science Dept., Univ. of Maryland, College Park, Md., 1988.
83. H. Samet, "Region Representation: Quadtrees from Binary Arrays,"Computer Graphics and Image Processing, May 1980, pp. 8893.
84. H. Samet, "An Algorithm for Converting Rasters to Quadtrees,"IEEE Trans. Pattern Analysis and Machine Intelligence, Jan. 1981, pp. 9395.
85. C.A. Shaffer,Application of Alternative Quadtree Representations, doctoral dissertation and Tech. Report TR1672, Computer Science Dept., Univ. of Maryland, College Park, Md., 1986.
86. C.A. Shaffer and H. Samet, "Optimal Quadtree Construction Algorithms,"Computer Vision, Graphics, and Image Processing, Mar. 1987, pp. 402419.
87. H. Freeman, "Computer processing of linedrawing images,"Computer Surveys, vol. 6, no. 1, Mar. 1974.
88. J.E. Bresenham, "Algorithm for Computer Control of a Digital Plotter,"IBM Systems J., Vol. 4, No. 1, pp. 2530.
89. H. Samet, "Region Representation: Quadtrees from Boundary Codes,"CACM, Mar. 1980, pp. 163170.
90. R.E. Webber,Analysis of Quadtree Algorithms, doctoral dissertation and Tech. Report TR1376, Computer Science Dept., Univ. of Maryland, College Park, Md., 1984.
91. C.R. Dyer, A. Rosenfeld, and H. Samet, "Region Representation: Boundary Codes from Quadtrees,"CACM, Mar. 1980, pp. 171179.
92. H. Samet, "Algorithms for the Conversion of Quadtrees to Rasters,"Computer Vision, Graphics, and Image Processing, Apr. 1984, pp. 116.
93. H. Samet, "Connected component labeling using quadtrees,"J. ACM, vol. 28, pp. 487501, July 1981.
94. H. Samet and M. Tamminen, "A General Approach to Connected Component Labeling of Images," Tech. Report TR1649, Computer Science Dept., Univ. of Maryland, College Park, Md., 1986. Also published inProc. IEEE Computer Vision and Pattern Recognition Conf., CS Press, Los Alamitos, Calif., 1986, pp. 312318.
95. H. Samet and R.E. Webber, "On Encoding Boundaries with Quadtrees," Tech. Report TR1162, Computer Science Dept., Univ. of Maryland, College Park, Md., 1982.
96. C.L. Jackins and S.L. Tanimoto, "QuadTrees, OctTrees, and kTreesA Generalized Approach to Recursive Decomposition of Euclidean Space,"IEEE Trans. Pattern Analysis and Machine Intelligence, Sept. 1983, pp. 533539.
97. H. Samet, "A TopDown Quadtree Traversal Algorithm,"IEEE Trans. Pattern Analysis and Machine Intelligence, Jan. 1985, pp. 9498.