article

Free Access

The Quadtree and Related Hierarchical Data Structures

Author:
Hanan Samet

Computer Science Department, University of Maryland, College Park, Maryland

Computer Science Department, University of Maryland, College Park, Maryland
View Profile

Authors Info & Claims

ACM Computing Surveys Volume 16 Issue 2pp 187–260https://doi.org/10.1145/356924.356930

Published:01 June 1984Publication History

ACM Computing Surveys

References

ABEL, D. J. 1984. A B+-tree structure for large quadtrees. Comput. Vision Gr. Image Process. 27, 1 (July), 19-31.]]Google ScholarCross Ref
ABEL, D. J., AND SMITH J. L. 1983. A data structure and algorithm based on a linear key for a rectangle retrieval problem. Comput. Vision Gr. Image Process. 24, 1 (Oct.), 1-13.]]Google ScholarCross Ref
AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.]] Google Scholar
AHUJA, N. 1983. On approaches to polygonal decomposition for hierarchical image representation. Comput. Vision Gr. Image Process. 24, 2 (Nov.) 200-214.]]Google Scholar
AHUJA, N., AND NASH, C. 1984. Octree representations of moving objects. Comput. Vision Gr. Image Process. 26, 2 (May), 207-216.]]Google Scholar
ANOERSON, D. P. 1983. Techniques for reducing pen plotting time. ACM Trans. Gr. 2, 3 (July), 197- 212.]] Google Scholar
BALLARI), D. H. 1981. Strip trees: A hierarchical representation for curves. Commun. A CM 24, 5 (May), 310~321. See also corrigendum, Commun. ACM 25, 3 (Mar. 1982), 213.]] Google Scholar
BELL, S. B. M., DiAZ, B. M., HOLROYD, F., AND JACKSON, M. J. 1983. Spatially referenced methods of processing raster and vector data. Image Vision Comput. 1, 4 (Nov.), 211-220.]]Google ScholarCross Ref
BENTLEY, J. L, 1975a. A survey of techniques for fixed radius near neighbor searching. SLAC Rep. No. 186, Stanford Linear Accelerator CenU~r, Stanford University, Stanford, Calif., Aug.]] Google Scholar
BENTLEY, J. L. 1975b. Multidimensional binary search trees used for associative searching. Commun. ACM 18, 9 (Sept.), 509-517.]] Google ScholarDigital Library
BENTLEY, J. L., ANO FaIEOMAN, J. H. 1979. Data structures for range searching. ACM Comput. Surv. 11, 4 (Dec.), 397-409.]] Google ScholarDigital Library
BENTLEY, J. L., AND STANAT, D. F. 1975. Analysis of range searches in quad trees. Inf. Process. Lett. 3, 6 (july), 170-173.]]Google Scholar
BESSLICH, P. W. 1982. Quadtree construction of binary images by dyadic array transformations. In Proceedings of the IEEE Conference on Pattern Recognition and Image Processing (Las Vegas, Nev., June). }EEE, New York, pp. 550-554.]]Google Scholar
BLUM, H. 1967. A transformation for extracting new descriptors of shape. In Models for the Perception of Speech and Visual Form, W. Wathen-Dunn, Ed. M.l.T. Press, Cambridge, Mass., pp. 362-380.]]Google Scholar
BROOKS, R. A., AND LOZANO-PEREZ, T. 1983. A subdivision algorithm in configuration space for findpath with rotation. In Proceedings of the 7th International Joint Conference on Artificial Intelligence (Karlsruhe, West Germany, Aug.). Kaufmann, Los Altos, Calif., pp. 799-806.]]Google Scholar
BURKHARDT, W. A. 1983. Interpolation-based index maintenance. BIT 23, 3, 274-294.]]Google ScholarCross Ref
BURT, P. J. 1980. Tree and pyramid structures for coding hexagonally sampled binary images. Cornput. Graphics Image Process. 14, 3 (Nov.), 249- 270.]]Google ScholarCross Ref
BURT, P. J., HONO, T. H., AND ROSENrELO, A. 1981. Segmentation and estimation of image region properties through cooperative hierarchical computation. IEEE Trans. Syst. Man Cybern. ! I, 12 (Dec.), 802-809.]]Google Scholar
BURTON, W. 1977. Representation of many-sided polygons and polygonal lines for rapid processing, Commun. ACM 20, 3 (Mar.), 166-171.]] Google ScholarDigital Library
BURTON, F. W., AND KOLLIAS, J. G. 1983. Comment on the explicit quadtree as a structure for computer graphics. Comput. J. 26, 2 (May), 188.]]Google ScholarCross Ref
CARLSON, W. E. 1982. An algorithm and data structure for 3D object synthesis using surface patch intersections. Comput. Gr. S{GGRAPH 82 Conf. Proc. 16, 3, 255-264.]] Google ScholarDigital Library
CHIEN, C. H., AND AGGARWAL, J. K. 1984. A normalized quadtree representation. Cornput. Vision Gr. Image Process. 26, 3 (June), 331-346.]]Google Scholar
COHEN, E., LYCHE, T., AND RIESENFELD, R. 1980. Discrete B-splines and subdivision techniques in computer-aided geometric design and computer graphics. Comput. Gr. Image Process. 14, 3 (Oct.), 87-111.]]Google Scholar
COMER, D. 1979. The ubiquitous B-tree. ACM Comput~ Surv. 11, 2 (June), 121-137.]] Google Scholar
CONNOLLY, C. I. 1984. Cumulative generation of octree models from range data. In Proceedings o{ the International Conference on Robotics (Atlanta, Ga., Mar.). IEEE, New York, pp. 25-32.]]Google Scholar
COOK, B. G. 1978. The structural and algorithmic basis of a geographic data base. In Proceedings o{ the First International Advanced Study Symposiurn on Topological Data Structures for Geographic Information Systems, G. Dutton, Ed., Harvard Papers on Geographic Information Systems, HaL- vard University Press, Cambridge, Mass.]]Google Scholar
CREUTZBURC,, E. 1981. Complexities of quadtrees and the structure of pictures. Tech. Rep. N/81/ 74, Computer Science Dept., Friedrich-Schiller University, Jena, East Germany.]]Google Scholar
DAVIS, L. S., AND ROUSSOPOULOS, N. 1980. Approximate pattern matching in a pattern database system. Inf Syst. 5, 2, 107-119.]]Google ScholarCross Ref
DECOULON, F., AND JOHNSEN, U. 1976. Adaptive block schemes for source coding of black-andwhite facsimile. Electron. Lett. 12, 3, 61-62. See also erratum, Electron. Lett. 12, 6 (1976), 152.]]Google ScholarCross Ref
DEFLORIANI, L., FALCiDIENO, B., NAGY, G., AND PIENOW, C. 1982. Yet another method for triangulation and contouring for automated cartography. In Proceedings of the American Congress on Surveying and Mapping (Hollywood, Fla.), F. S. Cardwell, R. Black, and B. M. Cole, Eds. American Society of Photogrammetry, pp. 101-110.]]Google Scholar
DEMILLO, R. A., EISENSTAT, S. C., AND LIPTON, R. J. 1978. Preserving average proximity in arrays. Commun. ACM 21, 3 (Mar.), 228-231.]] Google ScholarDigital Library
DOCTOR, L. J., AND TO,BOa(;, J. G. 1981. Display techniques for octree-encoded objects. IEEE Comput. Gr. Appl. 1, 1 (July), 39-46.]]Google Scholar
DUDA, R. O., AND HART, P. E. 1973. Pattern Classification and Scene Analysis. Wiley, New York.]]Google Scholar
DYER, C. R. 1980. Computing the Ruler number of an image from its quadtree. Comput. Gr. Image Process. 13, 3 (July), 270-276.]]Google ScholarCross Ref
DYER, C. R. 1981. A VLSI pyramid machine for parallel image processing, in Proceedings o{ the IEEE Conference on Pattern Recognition and linage Processing (Dallas, Tex.). IEEE, New York, pp. 381-386.]]Google Scholar
DYER, C. R. 1982. The space efficiency of quadtrees. Comput. Gr. Image Process. I9, 4 (Aug.), 335-348.]]Google Scholar
DYER, C. R., ROSENFELO, A., AND SAMET, H. t980. Region representation: Boundary codes from quadtrees. Commun. ACM 23, 3 (Mar.), 171- 179.]] Google Scholar
EASTMAN, C. M. 1970. Representations for space planning. Commun. ACM 13, 4 (Apr.), 242-250.]] Google ScholarDigital Library
EDELSBRUNNER, H. 1984. Key-problems and keymethods in computational geometry. In Proceedings of the Symposium of Theoretical Aspects o{ Computer Science (Paris, France), Lecture Notes in Computer Science, vol. 166. Springer Verlag, New York, pp. 1-13.]] Google Scholar
EDELSBRUNNER, H., AND VAN LEEUWEN, J. 1983. Multidimensional data structures and algorithms: A bibliography. Rep. F104, Institute for Information Processing, Technical University of Graz, Graz, Austria, Jan.]]Google Scholar
EDELSBRUNNER, H., GUIBAS, L. J., AND STOLFI, J. 1985. Optimal point location in a monotone subdivision. SIAM J. Comput. in press.]] Google Scholar
FAGIN, R., NIEVERGELT, J., PIPPENGER, N., AND STRONC~, H. R. 1979. Extendible hashing--A fast access method for dynamic files. A CM Trans. Database Syst. 4, 3 (Sept.), 315-344.]] Google ScholarDigital Library
FAUGERAS, O. D., ^~D PONCE, J. 1983. Prism trees: A hierarchical representation for 3-d objects. In Proceedings of the 7th International Joint Conference on Artificial Intelligence (Karlsruhe, West Germany, Aug.). Kaufmann, Los Altos, Calif., pp. 982-988.]]Google Scholar
FAUGERAS, O. D., HESF. RT, M., MUSSL P., a~r~ BOIS- 8ONNAT, J. D. 1984. Polyhedral approximation of 3-d objects without holes. Comput. Vision Gr. Image Process. 25, 2 (Feb.), 169-183.]]Google Scholar
FAVERJON, B. 1984. Obstacle avoidance using an octree in the configuration space of a manipulator. In Proceedings of the International Conference on Robotics (Atlanta, Ga., Mar.). IEEE, New York, pp. 504-512.]]Google Scholar
FINKEL, R. A., ANn BENTLEY, J. L. 1974. Quad trees: A data structure for retrieval on composite keys. A cta Inf. 4, 1, 1-9.]]Google Scholar
FREOKIN, E. 1960. Trie memory. Cornmun. ACM 3, 9 (Sept.), 490-499.]] Google Scholar
FREEMAN, H. 1974. Computer processing of linedrawing images. ACM Comput. Surv. 6, i (Mar.), 57-97.]] Google Scholar
FRIEDMAN, J. H., BENTLEY, J. L., AND FINKEL, R. A. 1977. An algorithm for finding best matches in logarithmic expected time. ACM Trans. Math. Softw. 3, 3 (Sept.), 209-226.]] Google ScholarDigital Library
GARGANTINI, I. 1982a. An effective way to represent quadtrees. Comrnun. ACM 25, 12 (Dec.), 9015-910.]] Google ScholarDigital Library
GARGANTINI, I. 1982b. Linear octtrees for fast processing of three dimensional objects. Comput. Gr. Image Process. 20, 4 (Dec.), 365-374.]]Google ScholarCross Ref
GARGANTINI, I. 1983. Translation, rotation, and superposition of linear quadtrees. Int. J. Man- Mach. Stud. 18, 3 (Mar.), 253-263.]]Google ScholarCross Ref
GASTON, P. C., ANt} LOzANO-PEREZ, T. 1984. Tactile recognition and localization using object models: The case of polyhedra on a plane. IEEE Trans. Pattern Anal Mach. lnte!l. 6, 3 (May), 257-266.]]Google Scholar
GIBSON, L., A~O LVCAS, D. 1982. Vectorization of raster images using hierarchical methods. Comput. Gr. Image Proces& 20, 1 (Sept.), 82-89.]]Google Scholar
GILLESPtE, R., AND DAVIS, W. A. 1981. Tree data structures for graphics and image processing. In Proceedings of the 7th Con/erence of the Canadian Man-Computer Communications Society (Waterloo, Canada, June), pp. 155-161.]]Google Scholar
GOMEZ, D., AND GUZMAN, A. 1979. Digital model for three-dimensional surface representation. Gee-Process. 1, 53-70.]]Google Scholar
GROSKY, W. I., ANn Jam, R. 1983. Optimal quadtrees for image segments. IEEE Trans. Pattern Anal Mach. InteU. 5, 1 (Jan.), 77--83.]]Google Scholar
HARARY, F. 1969. Graph Theory. Addison-Wesley, Reading, Mass.]]Google Scholar
HERTEL, S., AND MEHLHORN, K. 1983. Fast triangulation of simple polygons. In Proceedings of the 1983 International Foundations of Computation Theory Conference (Borgholm, Sweden, Aug.), Lecture Notes in Computer Science, vol. 158. Springer Verlag, New York, pp. 207-218.]] Google Scholar
HINRICHS, K., ^No NmWRt~ELT, J. 1983. The Grid File: A data structure to support proximity queries on spatial objects. Rep. 54, Institut fur Informatik, ETH, Zurich, July.]]Google Scholar
HOARE, C. A. R. 1972. Notes on data structuring. In Structured Programming, O. J. Dahl, E. W, Dijkstra, and C. A. R. i-{oare, Eds. Academic Press, London, p. 154.]] Google Scholar
HOROWlTZ, S. L., AND PAVLIDIS, T. 1976. Picture segmentation by a tree traversal algorithm. J. A CM 23, 2 (Apr.), 368-388.]] Google Scholar
HUFFMAN, D. A. 1952. A method for the construction of minimum-redundancy codes. Proc. IRE 40, 9 (Sept.), 1098-1101.]]Google ScholarCross Ref
HUNTER, G. M. 1978. Efficient computation and data structures for graphics. Ph.D. dissertation, Department of Electrical Engineering and Computer Science, Princeton University, Princeton, N.J.]] Google Scholar
HUNTER, G. M., A~D STF. IC, LI?Z, K. 1979a. Operations on images using quad trees. IEEE Trans. Pattern Anal. Mach. {ntell. 1, 2 (Apr.), 145-153.]]Google Scholar
HUNTER, G. M., A~D STEIGL1TZ, K. 1979b. Linear transformation of pictures represented by quad trees. Comput. Gr. Image Process. 10, 3 (July), 289-296.]]Google Scholar
IBRAHIM, H. A. H. 1984. The connected component labeling algorithm on the NON-VON supercompurer. In Proceedings of the Workshop on Computer Vision: Representation and Control (Annapolls, Md., Apr.). IEEE, New York, pp. 37-45.]]Google Scholar
ISMAIL, M. G. B., AND STEELE, R. 1980, Adaptive pel location coding for bilevel facsimile signals. Electron. Lett. 16, (May), 361-363]]Google ScholarCross Ref
JACKINS, C., AND TANIMOTO, S. L. 1980. Oct-trees and their use in representing three-dimensional objects. Comput. Gr. Image Process. 14, 3 (Nov.), 249-270.]]Google ScholarCross Ref
JACKINS, C., ^~o TA~tMOTO, S. L. 1983. Quad-trees, oct-trees, and k-trees-oA generalized approach to recursive decomposition of Euclidean space. IEEE Trans. Pattern Anal. Mach. IntelL 5, 5 (Sept.), 533-539.]]Google Scholar
JONES, L., AND IYEN(~AR, $. S. 1984. Space and time efficient virtual quadtrees. IEEE Trans. Pattern Anal. Mach. InteU. 6, 2 (Mar.), 244-247.]]Google Scholar
KAWAGUCHI, E., AbJD ENDO, T. 1980. On a method of binary picture representation and its application to data compression. IEEE Trans. Pattern Anal. Mach. Intell. 2, 1 (Jan.), 27-35.]]Google Scholar
KAWAGUCHI, E., ENDO, T., AND YOKOTA, M. 1980. DF-expression of binary-valued picture and its relation to other pyramidal representations. In Proceedings of the 5th International Conference on Pattern Recognition (Miami Beach, Fla., Dec.). IEEE, New York, pp, 822-827.]]Google Scholar
KAWAGUCHI, E., ENDO, T., AND MATSUNAGA, J. 1983. Depth-first expression viewed from digital picture processing. IEEE Trar~. Pattern Anal Mach. lntelt. 5, 4 (July), 373-384,]]Google Scholar
KEDEM, G. 1981. The Quad-CIF tree: A data structure for hierarchical on-line algorithms. Tech. Pep. 91, Computer Science Dept., The University of Rochester, Rochester, New York, Sept.]]Google Scholar
KELLY, M. D. 1971. Edge detection in pictures by computer using planning. Mach. Intell. 6, 397- 409.]]Google Scholar
KIRKPATRICK, D.r 1983. Optimal search in planar sub&visions. SlAM J. Comput. 12, I (Feb.), 28- 35.]]Google ScholarCross Ref
KLINGER, A. 1971. Patterns and search statistics. In Optimizing Methods in Statistics, J. S. Rustagi, Ed, Academic Press, New York, pp. 303-337.]]Google Scholar
KLINGER, A., AND DYER, C. R. 1976. Experiments in picture representation using regular decomposition. Comput. Gr. Image Process. 5, 1 (Mar), 68- 105.]]Google Scholar
KLINGER, A., AND RHODES, M. L. 1979. Organization and access of image data by areas. IEEE Trans. Pattern AnaI. Mach. Intell. 1, 1 (Jan.), 50- 60.]]Google Scholar
KNOTT, G. D. 1971. Expandable open addressing hash table storage and retrieval. In Proceedings of SIGFIDET Workshop on Data Description, Access, and Control (San Diego, Calif,, Nov.). ACM, New York, pp. 187-206.]]Google Scholar
KNOWLTON, K. 1980. Progressive transmission of grey-scale and binary pictures by simple, efficient, and lossless encoding schemes. Prec. IEEE 68, 7 (July), 885-896.]]Google ScholarCross Ref
KNUTH, D. E. 1973. The Art of Computer Programruing, vol. 3, Sorting and Searching. Addison- Wesley, Reading, Mass.]] Google Scholar
KNUTH, D. E. 1975. The Art of Computer Programming, vol. 1, Fundamental Algorithms, 2nd ed. Addison-Wesley, Reading, Mass.]] Google Scholar
LAUZON, J. P., MARK, D. M., KIKUCHi, L., A~O GUE- WRA, J. A. 1984. Two-dimensional run-encoding for quadtree representation. Unpublished manuscript, Department of Geography, State University of New York at Buffalo, Buffalo, New York.]]Google Scholar
LEE, D. T., AND SHACTER, B. J. 1980. Two algorithms for constructing a Delaunay triangulation. Int. J. Comput. Inf. Sc~ 9, 3 (June), 219-242.]]Google ScholarCross Ref
LEE, D. T., ANn WONTS, C. K. 1977. Worst-case analysis for region and partial region searches in multidimensional binary search trees and quad trees. Acta Inf. 9~ 1, 23-29.]]Google Scholar
LETELIER, P. 1983. Transmission d'images ~ bas dbit pour un syst~me de communication t~14phonique adapt~ aux sourds. Th~se de docteur-ing6nieur, Universit~ de Paris-Sud, Paris, Sept.]]Google Scholar
LI, M., GROSKY, W. I., AND JAIN, R. 1982. Normalized quadtrees with respect to translations. Comput. Gr. Image Procezs. 20, 1 (Sept.), 72-81.]]Google Scholar
LIIN, J. 1973. General methods for parallel searching. Tech. Rep. 81, Digital Systems Laboratory, Stanford University, Stanford, Calif., May.]]Google Scholar
LIPTON, R. J., AND TARJAN, R. E. 1977. Application of a planar separator theorem. {n Proceedings of the 18th Annual IEEE Symposium on the Foundations of Computer Science (Providence, R. I., Oct.). IEEE, New York, pp. 162-170.]]Google Scholar
LITWIN, W. 1980. Linear hashing: A new tool for lr~le and table addressing. In Proceedings of the 6th International Conference on Very Large Data Bases (Montreal, Oct.). IEEE, New York, pp. 212-223.]]Google Scholar
LOZANO-PEREZ, T. 1981. Automatic planning of manipulator transfer movements. IEEE Trans. Syst. Man Cybern. 11, 10 (Oct.), 681--698.]]Google ScholarCross Ref
LUMIA, R. 1983. A new three-dimensional connected components algorithm. Cornput. Vision Gr. Image Process. 23, 2 (Aug.), 207-217.]]Google Scholar
LUMIA, R., SHAPmO, L., At~o Zu~qmA, O. 1983. A new connected components algorithm for virtual memory computers. Comput. Vision Gr. Image Process. 22~ 2 (May), 287-300.]]Google Scholar
MARTIN, J. J. 1982. Organization of geographical data with quad trees and least square approximatlon. In Proceedings of the IEEE Conference on Pattern Recognition and Image Processing (Las Vegas, Nev., Junel. IEEE, New York, pp. 458- 463.]]Google Scholar
MATSUYAMA, T., HAD, L. V., AND NAGAO, M. 1984. A file organization for geographic information systems based on spatial proximity. Cornput. Vision Gr. Image Process. 26, 3 (June), 303- 318.]]Google Scholar
MCCLUSKEY, E. J. 1965. Introduction to the Theory of Switching Circuits. McGraw-Hill, New York, pp. 60-61.]]Google Scholar
MCKEOWN, D. M., JR., AND DENLINOER, J. L. 1984. Map-guided feature extraction from aerial imagery. In Proceedings of the Workshop on Corn. puter Vision: Representation and Control (Annapolis, Md., Apr.). {EEE, New York, pp. 205-213.]]Google Scholar
MEACHER, D. 1982. Geometric modeling using octree encoding. Comput. Gr. ~mage Process. t9, 2 (June), 129-147.]]Google ScholarCross Ref
MERRETT, T. H. 1978. Multidimensional paging for efficient database querying. {n Proceedings of the International Conference on Management of Data (Milan, Italy, June), pp. 277-289.]]Google Scholar
MERRETT, T. H., ANO OTOO, E. J. 1981. Dynamic multipaging: A storage structure for large shared data banks. In Improving Database Usability and Responsiveness, P. Scheuermann, Ed. Academic Press, New York, pp. 237-254.]]Google Scholar
MERRILL, R. D. 1973. Representations of contours and regions for efficient computer search. Cornmun. ACM 16, 2 (Feb.), 69-82.]] Google ScholarDigital Library
MILFORD, D. J., AND WILLIS, P. C. 1984. Quad encoded display. IEE Proc. 131, E3 (May), 70- 75.]]Google Scholar
MINSKY, M., AND PAPERT, S. 1969. Perceptrons: An Introduction to Computational Geometry. M.I.T. Press, Cambridge, Mass.]] Google ScholarDigital Library
MORTON, G. M. 1966. A computer oriented geodetic data base and a new technique in file sequencing. Unpublished manuscript, iBM, Ltd., Ottawa, Canada.]]Google Scholar
MUDUR, S. P., AND KOPARKAR, P. A. 1984. Interval methods for processing geometric objects. IEEE Comput. Gr. AppL 4, 2 (Feb.), 7-17.]]Google Scholar
NAGY, G., AND WAGLE, $. 1979. Geographic data processing. ACM Cornput. Surv. 11, 2 (June), 139- 181.]] Google Scholar
NIEVERGELT, J., AND PREPARATA, F. P. 1982. Planesweep algorithms for intersecting geometric figures. Commun. ACM 25, 10 (Oct.), 739-746.]] Google ScholarDigital Library
NIEVERGELT, J., H{NTERBERGER, H., AND SEVCIK, K. C. 1984. The Grid File: An adaptable, symmetric multikey fie structure. A CM Trans. Database Syst. 9, 1 (Mar.), 38-71.]] Google ScholarDigital Library
NILSSON, N. J. 1969. A mobile automaton: An application of artificial intelligence techniques. In Proceedings of the 1st international Joint Conference on Artificial Intelligence (Washington D.C.). Kaufmann, Los Altos, Calif., pp. 509-520.]]Google Scholar
OLIVER, M. A., AND WISEMAN, N. E. 1983a, Operations on quadtree-encoded images. Comput. J. 26, i (Feb.), 83-91.]]Google ScholarCross Ref
OLIVER, M. A., AND WISEMAN, N. E. 1983b. Operations on quadtree leaves and related image areas. Comput. J. 26, 4 (Nov.), 375-380.]]Google Scholar
OMOLAYOLE, J. O., AND KLINGER, A. 1980. A hierarchical data structure scheme for storing pictures. In Pictorial Information Systems, S. K. Chang and K. S. Fu, Eds. Springer-Verlag, Berlin and New York, 1980.]]Google Scholar
ORE.NSTEIN, J. A. 1982. Multidimensional tries used for associative searching. Inf. Process. Lett. 14, 4 (June), 150-157.]]Google Scholar
ORENSTEIN, J. A. 1983. A dynamic hash file for random and sequential accessing. In Proceedings of the 6~h International Conference on Very Large Data Bases (Florence, italy, Oct.). IEEE, New York, pp. 132-141.]] Google Scholar
ORESTEIN, J. A., AND M~RREVT, T. H. 1984. A class of data structures for associative searching, In Proceedings of the 3rd ACM SIGACT-SIG- MOD Symposium on Principles of Database Systems (Waterloo, Ontario, Apr.). ACM, New York, pp. 181-190.]] Google Scholar
O'ROURKE, J. 1981. Dynamically quantized spaces for focusing the Hough Transform. In Proceedings o{ the 6th International Joint Conference on Artificial Intelligence (Vancouver, B.C., Aug.). Kaufmann, Los Altos, Calif., pp. 737-739.]]Google Scholar
O'ROURKE, J., AND SLOAN, K. R., JR. 1984. Dynamic quantization: Two adaptive data structures for multidimensional squares. IEEE Trans. Pattern Anal. Math. Intell 6, 3 (May), 266- 280.]]Google Scholar
OUKSEL, M., AND SCHEUERMANN, P. 1983. Storage mappings for multidimensional linear dynamic hashing, in Proceedings o/ the 2nd A CM SI- GA CT-SIGMOD Symposium on Principles of Databo~se Systems (Atlanta, Ga., Mar.). ACM, New York, pp. 90-105.]] Google Scholar
OVRRMARS, M. H. 1983. The Design of Dynamic Data Structures, Lecture Notes in Computer Science, vol. 156. Springer-Verlag, New York.]] Google Scholar
OVERMARS, M. H., ANb VAN LEEUWEN, J. 1982. Dynamic multi-dimensional data structures based on quad- and k-d trees. Acta Inf. 17, 3, 267-285.]]Google ScholarDigital Library
PETERS, F. 1984. An algorithm for transformations of pictures represented by quadtrees, Dept. of Mathematics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands.]]Google Scholar
PEUCKER, T. 1976. A theory of the cartographic line, int. Yearb. Cartogr. 16, 34--43.]]Google Scholar
PEUQUET, D. J. 1979. Raster processing: An alternative approach to automated cartographic data handling. Am. Cartogr. 2 {Apr.), 129-239.]]Google ScholarCross Ref
PEUQUET, D. J. 1983. A hybrid data structure for the storage and manipulation of very large spatial data sets. Comput. Vision Gr. Image Process. 24, I (Oct.), 14-27.]]Google ScholarCross Ref
PFALTZ, J. L., AND ROSENFELD, A. 1967. Computer representation of planar regions by their skeletons. Commun. ACM t0, 2 (Feb.), 119-122.]] Google Scholar
PIETIKAINEN, M., ROSENFELD, A., AND WALTER, I. 1982. Split-and-link algorithms for image segmentation. Pattern Recognition 15, 4, 287-298.]]Google ScholarCross Ref
RAMAN, V., AND IYENGAR, S. S. 1983. Properties and applications of forests of quadtrees for pictorial data representation. BIT 23, 4, 472-486.]]Google ScholarCross Ref
RANADE, S. 1981. Use of quadtrees for edge enhancemeat. IEEE Trans. Syst. Man, Cybern. 11, 5 (May), 370-373.]]Google Scholar
RANADE, S., ANO SHeEtER, M. 1981. Using quadtrees to smooth images. IEEE Trans. Syst. Man Cybern. 11, 5 (May), 373-376.]]Google Scholar
RANADE, S., ROSENFELD, A., AND PREWITT, J. M. S, 1980. Use of quadtrees for image segmentation. TR-878, Dept. of Computer Science, University of Maryland, College Park, Md., Feb.]]Google Scholar
RANADE, $., ROSENFELD, A., AND SAMET, H. 1982. Shape approximation using quadtrees. Pattern Recognition 15, 1, 31-40.]]Google ScholarCross Ref
REDDY, D. R., AND RUBIN, S. 1978. Representation of three-dimensional objects. CMU-CS-78-113, Computer Science Dept., Carnegie-Mellon University, Pittsburgh, Apr.]]Google Scholar
REQUICHA, A. A. G. 1980. Representations of rigid solids: Theory, methods, and systems. ACM Comput. Surv. 12, 4 (Dec.), 437-464.]] Google ScholarDigital Library
RHEINBOLDT, W. C., AND MESZTENY{, C. K. 1980. On a data structure for adaptive finite element mesh refinements. ACM Trans. Math. Softw. 6, 2 (June), 166+187.]] Google ScholarDigital Library
RISEMAN, E. M., AND ARBIB, M. A. 1977. Computational techniques in the visual segmentation of static scenes. Comput. Gr~ Image Process. 6, 3 (June), 221-276.]]Google Scholar
ROSENSON, J. T. 1981. The k-d-B-tree: A search structure for large multidimensional dynamic indexes. In Proceedings of the SIGMOD Conference (Ann Arbor, Mich., Apr.). ACM, New York, pp. 10-18.]] Google Scholar
ROSENFELD, A., ED. 1983. Muitiresolution Image Processing and Analysis. Springer-Verlag, Berlin and New York.]]Google Scholar
ROSENFELD, A. 1984. Picture processing 1984. Cornput. Vision Gr. Image Process. 26, 3 (June), 347- 384.]]Google Scholar
ROSENFELD, A., ANO KAK, A. C. 1982. Digital Picture Processing, 2nd ed. Academic Press, New York.]] Google Scholar
ROSENFELD, A., A~D PFALTZ, J. L. 1966. Sequential operations in digital image processing. J. ACM 13, 4 (Oct.), 471-494.]] Google Scholar
ROSENFELD, A., SAME?, H., SHArrr. lt, C., A~o WEB- BER, R. E. 1982. Application of hierarchical data structures to geographical information systems. TR-1197, Computer Science Dept., University of Maryland, College Park, iV{&, June.]]Google Scholar
ROSENFELO, A., S^MET, H., SI~ArF~R, C., A~o WEB- BER, R. E. 1983. Application of hierarchical data structures to geographical information systerns phase II. TR-1327, Computer Science Dept., University of Maryland, College Park, Md., Sept.]]Google Scholar
ROTH, S. D. 1982. Ray casting for modeling solids. Comput. Gr. Image Process. {8, 2 (Feb.), 109-144.]]Google ScholarCross Ref
RUTOWTZ, D. 1968. Data structures for operations on digital images. In Pictorial Pattern Recognition, G. C. Cheng et al., Eds. Thompson Book Co., Washington D.C., pp. 105-133.]]Google Scholar
SAMET, H. 1980a. Region representation: Quadtrees from boundary codes. Cornmun. A CM 23, 3 (Mar.), 163-170.]] Google ScholarDigital Library
SAMET, H. 1980b, Region representation: Quadtrees from binary arrays. Comput. Gr. Image Process. t3, 1 (May), 88-93.]]Google ScholarCross Ref
SAMET, H. 1980c. Deletion in two-dimensional quad trees. Commun. ACM 23, 12 (Dec.), 703-710.]] Google ScholarDigital Library
SAMET, H. 1981a. An algorithm for converting rasters to quadtrees. IEEE Trans. Pattern Anal. Mech. lnteU. 3, 1 (Jan.), 93-95.]]Google Scholar
SAMET, H. 1981b. Connected component labeling using quadtrees. J. ACM 28, 3 (July), 487-501.]] Google ScholarDigital Library
SAMET, H. 1981c. Computing perimeters of images represented by quadtrees. IEEE Trans. Pattern Anal. Mactr lntell. 3, 6 (Nov.), 683-687.]]Google Scholar
SAMET, H. 1982a. Neighbor finding techniques for images represented by quadtrees. Comput. Gr. Image Process. 18, 1 (Jan.), 37~57.]]Google ScholarCross Ref
SAMET, H. 1982b. Distance transform for images represented by quadtrees, iEEE Trans. Pattern Anal Mech. lntell. 4, 3 (May), 298-303.]]Google Scholar
SAMET, H. 1983. A quadtree medial axis transform. Commun. ACM 26, 9 (Sept.), 680-693. See also corrigendum, Commun. ACM 27, 2 (Feb. 1984), 151.]] Google ScholarDigital Library
SAMET, H. 1984. Algorithms for ~he conversion of quadtrees to rasters. Comput. Vision Gr. Image Process. 26, 1 (Apr.), 1-16.]]Google ScholarCross Ref
SAMET, H. 1985a. A top-down quadtree traversal algorithm. IEEE Trans. Pattern Anal. Mech. Intell. 7, 1 (Jan.) in press. Also TR-1237, Computer Science Dept., University of Maryland.]]Google Scholar
SAMET, }H. 1985b. Reconstruction of quadtrees from quadtree medial axis transforms. Comput. Vision Gr. Image Process. 29, 2 (Feb.) in press. Also TR- 1224, Computer Science Dept., University of Maryland.]]Google Scholar
SAMET, H. 1985c. Data structures for quadtree approximation and compression. Commun. A CM 28 in press. Also TR-1209, Computer Science Dept., University of Maryland.]] Google Scholar
SAMET, H., AND KRISHNAMURTHY, E. V. 1983. A quadtree-based matrix manipulation system. Unpublished manuscript of work in progress.]]Google Scholar
SAMET, H., AND ROSENFELD, A. 1980. Quadtree structures for image processing. In Proceedings of the 5th International Conference on Pattern Recognition (Miami Beach, Fla., Dec.). IEEE, New York, pp. 815-818.]]Google Scholar
SAMET, H., aND SHAFFER, C. A. 1984. A model for the analysis of neighbor finding in pointer-based quadtrees. TR-t432, Computer Science Dept., University of Maryland, College Park, Md., Aug.]]Google Scholar
SAMET, H., A~D TAMbIINE~I, M. 1984. Efficient image component labeling. TR-1420, Computer Science Dept., University of Maryland, College Park, Md., July.]]Google Scholar
SAMET, H., AND TAMMINEN, M. 1985. Computing geometric properties of images represented by linear quadtrees. IEEE Trar~. Pattern Anal Mech. lntetl. 7, 1 (Jan.) in press. Also TR-1359, Computer Science Dept., University of Maryland.]]Google Scholar
SAMET, H., AND WEBBER, R. E. 1982. On encoding boundaries with quadtrees. TR-1162, Computer Science Dept., University of Maryland, College Park, Md., Feb.]]Google Scholar
SAMET, H., AND WEBBER, R. E. 1983. Using quadtrees to represent polygonal maps. In Proceedings of Computer Vision and Pattern Recognition 83 (Washington, DC, June). IEEE, New York, pp. 127-132. Also TR-1372, Computer Science Dept., University of Maryland.]]Google Scholar
SAMET, H., ANO WEBBER, R. E. 1984. On encoding boundaries with quadtrees. IEEE Trans. Pattern Anal. Mech. InteU. 6, 3 (May), 365-369.]]Google Scholar
SHAMOS, M. L, 1978. Computational geometry. Ph.D. dissertation, Dept. of Computer Science, Yale University, New Haven, Conn.]] Google Scholar
SHAMOS, M. I., ANn HOE'/, D. 1975. Closest-point problems. In Proceedings o/ the 16th Annual Symposium on the Foundations of Computer Science (Berkeley, Calif., Oct.). IEEE, New York, pp. 151-162.]]Google Scholar
SHNEIER, M. 198Ia. Calculations of geometric properties using quadtrees. Comput. Gr. Image Process. 16, 3 (July), 296-302.]]Google Scholar
SHNEIER, M. 1981b. Path-length distances for quadtrees. Inf. Sci. 23, I (Feb.), 49-67.]]Google ScholarCross Ref
SHNEIER, M. 1981c. Two hierarchical linear feature representations: Edge pyramids and edge quadtrees. Comput. Gr. Image Process. 17, 3 (Nov.), 211-224.]]Google Scholar
SLOAN, K. R., JR. 1981. Dynamically quantized pyramids. In Proceedings of the 6th International Joint Conference on Artificial Intelligence (Vancouver, B.C., Aug.). Kaufmann, Los Altos, Calif., pp. 734-736.]]Google Scholar
SLOAN, K. R., JR., AND TANIMOTO, S. L. 1979. Progressive refinement of raster images. 1EEE Trans. Comput. 28, 11 (Nov.), 871-874.]]Google Scholar
SRIHARI, S. N. 1981. Representation ofthree-dimensional digital images. ACM Comput. Surv. 13, 1 (Dec.), 399-424.]] Google ScholarDigital Library
SUTHERLAND, I. E., SPROULL, R. F., AND SCHU- MACKER, g. A. 1974. A characterization of ten hidden-surface algorithms. ACM Comput. Surv. 6, 1 (Mar.), 1-55.]] Google ScholarDigital Library
TAMMINgN, M. 1981. The EXCELL method for eL ficient geometric access to data. Acta Potytech. Scand. Mathematics and Computer Science Series No. 34, Helsinki,]]Google Scholar
TAMMINEN, M. 1982. Hidden lines using the EX- CELL method. Comput. Gr. Forum l 1, 3, 96-105.]]Google ScholarCross Ref
TAMMINRN, M. 1983. Performance analysis of cell based geometric file organizations. Comput. Vision Gr. Image Process. 24, 2 (Nov.), 168-181.]]Google Scholar
TAMMINEN, M. 1984a. Comment on quad- and octtrees. Commun. ACM 27, 3 (Mar.), 248-249.]] Google ScholarDigital Library
TAMMIN~2N, M. 1984b. Encoding pixel trees. Cornput. Vision Gr. Image Process. 28, 1 (Oct.), 44-57.]]Google Scholar
TAMMiNEN, M., AND SAMET, H. 1984. Efficient octree conversion by connectivity labeling. In Proceedings of the SIGGRAPH 84 Conference (Minneapolis, Minn., July). ACM, New York, pp. 43-51.]] Google Scholar
TANIMOTO, S. 1976. Pictorial feature distortion in a pyramid. Comput. Gr. Image Process. 5, 3 (Sept.), 333-352.]]Google Scholar
TANIMOTO, S. 1979. Image transmission with gross information first. Comput. Graph. Image Process. 9, 1 (Jan.), 72-76.]]Google ScholarCross Ref
TANIMOTO, S., AND KLINGER, A. EDS. 1980. Structured Computer Vision. Academic Press, New York.]]Google Scholar
TANIMOTO, S., AND PAVLIDIS, T. 1975. A hierarchical data structure for picture processing. Comput. Gr. Image Process. 4, 2 (June), 104-119.]]Google ScholarCross Ref
TARJAN, R. E. 1975. Efficiency of a good but not linear set union algorithm. J. ACM 22, 2 (Apr.), 215-225.]] Google ScholarDigital Library
TOUSSAINT, G. T. 1980. Pattern recognition and geometrical complexity. In Proceedings of the 5th International Conference on Pattern Recognition (Miami Beach, Fla., Dec.). IEEE, New York, pp. 1324-1346.]]Google Scholar
TROPF, H., AND Ht~RZOG, H. 1981. Multidimensional range search in dynamically balanced trees. Angew. Inf. 2, 71-77.]]Google Scholar
TUCKER, L. W. 191Ma. Control strategy for an expert vision system using quadtree refinement. In Proceedings of the Workshop on Computer Vision: Representation and Control (Annapolis, Md., Apr.). IEEE, New York, pp. 214-218.]]Google Scholar
TUCKER, L. W. 1984b. Computer vision using quadtree refinement. Ph.D. dissertation, Dept. Electrical Engineering and Computer Science, Polytechnic Institute of New York, Brooklyn, N.Y., May.]] Google Scholar
UHR, L. 1972. Layered "recognition cone" networks that preprocess, classify, and describe, iEEE Trans. Compu~ 21, 7 (July), 758-768.]]Google Scholar
UNNIKRISHNAN, A., ANo VENKATESH, Y. V. 1984. On the conversion of raster to linear quadtrees. Department of Electrical Engineering, Indian Institute of Science, Bangalore, India, May.]]Google Scholar
V^N L~.UWEN, J., AND WOOD, D. 1981. The measure problem for rectangular ranges in d-space. J. Algorithms 2, 3 (Sept.), 282-300.]]Google Scholar
VAN LIEROP, M. L. P. 1984. Transformations on pictures represented by leafcodes. Dept. of Math. emetics and Computing Science, Eindhoven University of Technology, Eindhoven, The Netherlands.]]Google Scholar
WARNOCg;, J. L. 1969. A hidden surface algorithm for computer generated half tone pictures. TR 4- 15, Computer Science Dept., University of Utah, Salt Lake City, June.]]Google Scholar
WEBBER, R. E. 1984. Analysis of quadtree algorithms. Ph.D. dissertation, Computer Science Dept., University of Maryland, College Park, Md., Mar. Also TR-1376, Computer Science Dept., University of Maryland.]] Google Scholar
WEBER, W. 1978. Three types of map data structures, their ANDs and NOTs, and a possible OR. In Proceedings of the 1st International Advanced Study Symposium on Topological Data Structures for Geographic In{ormation Systems, G. Dutton, Ed. Harvard Papers on Geographic Information Systems, Harvard Univ. Press, Cambridge, Mass.]]Google Scholar
WILLARD, D. E. 1982. Polygon retrieval. SIAM J. Comput. 1I, I (Feb.), 149-165.]]Google Scholar
WOODWARK, J. R. 1982. The explicit quadtree as a structure for computer graphics. Comput. J. 25, 2 (May), 235-238.]]Google Scholar
WU, A. Y., HON(~, T. H., AND ROSENFELO, A. 1982. Threshold selection using quadtrees. IEEE Trans. Pattern Anal Mach. InteU. 4, 1 (Jan.), 90-94.]]Google Scholar
YAMAGUCHi, K., KUNII, T. L., FUJIMURA, K., AND TORIYA, H. 1984. Octree-relateddata structures and algorithms. IEEE Comput. Gr. Appl. 4, 1 (Jan.), 53-59.]]Google Scholar
YAU, M. 1984. Generating quadtrees of cross-sections from octrees. Comput. Vision Gr. image Process. 27, 2 (Aug.), 211-238.]]Google Scholar
YAU, M., A~D SP~Agl, S. N. 1983. A hierarchical data structure for multidimensional digital iraages. Commun. ACM 26, 7 (July), 504-515.]] Google ScholarDigital Library
YERRY, M. A., A~D SHEPARD, M. S. 1983. A modified quadtree approach to finite element mesh generation, iEEE Cornput. Gr. AppL 3, I (Jan./ Feb.), 39-46.]]Google ScholarDigital Library

Index Terms

Recommendations

Continuous optimization of adaptive quadtree structures
Abstract
We present a novel continuous optimization method to the discrete problem of quadtree optimization. The optimization aims at achieving a quadtree structure with the highest mechanical stiffness, where the edges in the quadtree are ...
Highlights
- A novel continuous formulation to the discrete problem of quadtree optimization.
Read More
Application of alternative quadtree representations (vlsi, data structures)
Read More
Efficient Triangular Surface Approximations Using Wavelets and Quadtree Data Structures

We present a new method for adaptive surface meshing and triangulation which controls the local level-of-detail of the surface approximation by local spectral estimates. These estimates are determined by a wavelet representation of the surface data. The ...
Read More

Comments

Login options

Check if you have access through your login credentials or your institution to get full access on this article.

Full Access

Get this Article

Published in
ACM Computing Surveys Volume 16, Issue 2
June 1984
161 pages
ISSN:0360-0300
EISSN:1557-7341
DOI:10.1145/356924
Editor:
Adele Goldberg
Issue’s Table of Contents
Copyright © 1984 ACM
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]
Sponsors
In-Cooperation
Publisher
Association for Computing Machinery
New York, NY, United States
Publication History
- Published: 1 June 1984
Published in csur Volume 16, Issue 2

Permissions
Request permissions about this article.
Request Permissions

Check for updates
Qualifiers
- article
Conference
Funding Sources
Other Metrics
View Article Metrics

Article Metrics
- 1,603
  Total Citations
  View Citations
- 12,676
  Total Downloads
- Downloads (Last 12 months)817
- Downloads (Last 6 weeks)121
Other Metrics
View Author Metrics
Cited By
View all

PDF Format

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

The Quadtree and Related Hierarchical Data Structures

ACM Computing Surveys

References

Cited By

Index Terms

Recommendations

Continuous optimization of adaptive quadtree structures

Application of alternative quadtree representations (vlsi, data structures)

Efficient Triangular Surface Approximations Using Wavelets and Quadtree Data Structures

Comments

Login options

Full Access

Published in

Sponsors

In-Cooperation

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Funding Sources

Other Metrics

Article Metrics

Other Metrics

Cited By

PDF Format

eReader

Digital Edition

Caption

The Quadtree and Related Hierarchical Data Structures

ACM Computing Surveys

References

Cited By

Index Terms

Recommendations

Continuous optimization of adaptive quadtree structures

Application of alternative quadtree representations (vlsi, data structures)

Efficient Triangular Surface Approximations Using Wavelets and Quadtree Data Structures

Comments

Login options

Full Access

Published in

Sponsors

In-Cooperation

Publisher

Publication History

Permissions

Check for updates

Qualifiers

Conference

Funding Sources

Article Metrics

Other Metrics

PDF Format

eReader

Digital Edition

Share this Publication link

Share on Social Media