The Quadtree and Related Hierarchical Data Structures (original) (raw)

Authors Info & Claims

Published: 01 June 1984 Publication History

First page of PDF

References

[1]

ABEL, D. J. 1984. A B+-tree structure for large quadtrees. Comput. Vision Gr. Image Process. 27, 1 (July), 19-31.]]

[2]

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.]]

[3]

AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.]]

[4]

AHUJA, N. 1983. On approaches to polygonal decomposition for hierarchical image representation. Comput. Vision Gr. Image Process. 24, 2 (Nov.) 200-214.]]

[5]

AHUJA, N., AND NASH, C. 1984. Octree representations of moving objects. Comput. Vision Gr. Image Process. 26, 2 (May), 207-216.]]

[6]

ANOERSON, D. P. 1983. Techniques for reducing pen plotting time. ACM Trans. Gr. 2, 3 (July), 197- 212.]]

[7]

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.]]

[8]

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.]]

[9]

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.]]

[10]

BENTLEY, J. L. 1975b. Multidimensional binary search trees used for associative searching. Commun. ACM 18, 9 (Sept.), 509-517.]]

[11]

BENTLEY, J. L., ANO FaIEOMAN, J. H. 1979. Data structures for range searching. ACM Comput. Surv. 11, 4 (Dec.), 397-409.]]

[12]

BENTLEY, J. L., AND STANAT, D. F. 1975. Analysis of range searches in quad trees. Inf. Process. Lett. 3, 6 (july), 170-173.]]

[13]

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.]]

[14]

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.]]

[15]

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.]]

[16]

BURKHARDT, W. A. 1983. Interpolation-based index maintenance. BIT 23, 3, 274-294.]]

[17]

BURT, P. J. 1980. Tree and pyramid structures for coding hexagonally sampled binary images. Cornput. Graphics Image Process. 14, 3 (Nov.), 249- 270.]]

[18]

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.]]

[19]

BURTON, W. 1977. Representation of many-sided polygons and polygonal lines for rapid processing, Commun. ACM 20, 3 (Mar.), 166-171.]]

[20]

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.]]

[21]

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.]]

[22]

CHIEN, C. H., AND AGGARWAL, J. K. 1984. A normalized quadtree representation. Cornput. Vision Gr. Image Process. 26, 3 (June), 331-346.]]

[23]

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.]]

[24]

COMER, D. 1979. The ubiquitous B-tree. ACM Comput~ Surv. 11, 2 (June), 121-137.]]

[25]

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.]]

[26]

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.]]

[27]

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.]]

[28]

DAVIS, L. S., AND ROUSSOPOULOS, N. 1980. Approximate pattern matching in a pattern database system. Inf Syst. 5, 2, 107-119.]]

[29]

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.]]

[30]

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.]]

[31]

DEMILLO, R. A., EISENSTAT, S. C., AND LIPTON, R. J. 1978. Preserving average proximity in arrays. Commun. ACM 21, 3 (Mar.), 228-231.]]

[32]

DOCTOR, L. J., AND TO,BOa(;, J. G. 1981. Display techniques for octree-encoded objects. IEEE Comput. Gr. Appl. 1, 1 (July), 39-46.]]

[33]

DUDA, R. O., AND HART, P. E. 1973. Pattern Classification and Scene Analysis. Wiley, New York.]]

[34]

DYER, C. R. 1980. Computing the Ruler number of an image from its quadtree. Comput. Gr. Image Process. 13, 3 (July), 270-276.]]

[35]

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.]]

[36]

DYER, C. R. 1982. The space efficiency of quadtrees. Comput. Gr. Image Process. I9, 4 (Aug.), 335-348.]]

[37]

DYER, C. R., ROSENFELO, A., AND SAMET, H. t980. Region representation: Boundary codes from quadtrees. Commun. ACM 23, 3 (Mar.), 171- 179.]]

[38]

EASTMAN, C. M. 1970. Representations for space planning. Commun. ACM 13, 4 (Apr.), 242-250.]]

[39]

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.]]

[40]

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.]]

[41]

EDELSBRUNNER, H., GUIBAS, L. J., AND STOLFI, J. 1985. Optimal point location in a monotone subdivision. SIAM J. Comput. in press.]]

[42]

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.]]

[43]

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.]]

[44]

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.]]

[45]

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.]]

[46]

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.]]

[47]

FREOKIN, E. 1960. Trie memory. Cornmun. ACM 3, 9 (Sept.), 490-499.]]

[48]

FREEMAN, H. 1974. Computer processing of linedrawing images. ACM Comput. Surv. 6, i (Mar.), 57-97.]]

[49]

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.]]

[50]

GARGANTINI, I. 1982a. An effective way to represent quadtrees. Comrnun. ACM 25, 12 (Dec.), 9015-910.]]

[51]

GARGANTINI, I. 1982b. Linear octtrees for fast processing of three dimensional objects. Comput. Gr. Image Process. 20, 4 (Dec.), 365-374.]]

[52]

GARGANTINI, I. 1983. Translation, rotation, and superposition of linear quadtrees. Int. J. Man- Mach. Stud. 18, 3 (Mar.), 253-263.]]

[53]

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.]]

[54]

GIBSON, L., A~O LVCAS, D. 1982. Vectorization of raster images using hierarchical methods. Comput. Gr. Image Proces& 20, 1 (Sept.), 82-89.]]

[55]

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.]]

[56]

GOMEZ, D., AND GUZMAN, A. 1979. Digital model for three-dimensional surface representation. Gee-Process. 1, 53-70.]]

[57]

GROSKY, W. I., ANn Jam, R. 1983. Optimal quadtrees for image segments. IEEE Trans. Pattern Anal Mach. InteU. 5, 1 (Jan.), 77--83.]]

[58]

HARARY, F. 1969. Graph Theory. Addison-Wesley, Reading, Mass.]]

[59]

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.]]

[60]

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.]]

[61]

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.]]

[62]

HOROWlTZ, S. L., AND PAVLIDIS, T. 1976. Picture segmentation by a tree traversal algorithm. J. A CM 23, 2 (Apr.), 368-388.]]

[63]

HUFFMAN, D. A. 1952. A method for the construction of minimum-redundancy codes. Proc. IRE 40, 9 (Sept.), 1098-1101.]]

[64]

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.]]

[65]

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.]]

[66]

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.]]

[67]

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.]]

[68]

ISMAIL, M. G. B., AND STEELE, R. 1980, Adaptive pel location coding for bilevel facsimile signals. Electron. Lett. 16, (May), 361-363]]

[69]

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.]]

[70]

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.]]

[71]

JONES, L., AND IYEN(~AR, $. S. 1984. Space and time efficient virtual quadtrees. IEEE Trans. Pattern Anal. Mach. InteU. 6, 2 (Mar.), 244-247.]]

[72]

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.]]

[73]

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.]]

[74]

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,]]

[75]

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.]]

[76]

KELLY, M. D. 1971. Edge detection in pictures by computer using planning. Mach. Intell. 6, 397- 409.]]

[77]

KIRKPATRICK, D.r 1983. Optimal search in planar sub&visions. SlAM J. Comput. 12, I (Feb.), 28- 35.]]

[78]

KLINGER, A. 1971. Patterns and search statistics. In Optimizing Methods in Statistics, J. S. Rustagi, Ed, Academic Press, New York, pp. 303-337.]]

[79]

KLINGER, A., AND DYER, C. R. 1976. Experiments in picture representation using regular decomposition. Comput. Gr. Image Process. 5, 1 (Mar), 68- 105.]]

[80]

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.]]

[81]

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.]]

[82]

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.]]

[83]

KNUTH, D. E. 1973. The Art of Computer Programruing, vol. 3, Sorting and Searching. Addison- Wesley, Reading, Mass.]]

[84]

KNUTH, D. E. 1975. The Art of Computer Programming, vol. 1, Fundamental Algorithms, 2nd ed. Addison-Wesley, Reading, Mass.]]

[85]

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.]]

[86]

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.]]

[87]

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.]]

[88]

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.]]

[89]

LI, M., GROSKY, W. I., AND JAIN, R. 1982. Normalized quadtrees with respect to translations. Comput. Gr. Image Procezs. 20, 1 (Sept.), 72-81.]]

[90]

LIIN, J. 1973. General methods for parallel searching. Tech. Rep. 81, Digital Systems Laboratory, Stanford University, Stanford, Calif., May.]]

[91]

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.]]

[92]

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.]]

[93]

LOZANO-PEREZ, T. 1981. Automatic planning of manipulator transfer movements. IEEE Trans. Syst. Man Cybern. 11, 10 (Oct.), 681--698.]]

[94]

LUMIA, R. 1983. A new three-dimensional connected components algorithm. Cornput. Vision Gr. Image Process. 23, 2 (Aug.), 207-217.]]

[95]

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.]]

[96]

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.]]

[97]

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.]]

[98]

MCCLUSKEY, E. J. 1965. Introduction to the Theory of Switching Circuits. McGraw-Hill, New York, pp. 60-61.]]

[99]

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.]]

[100]

MEACHER, D. 1982. Geometric modeling using octree encoding. Comput. Gr. ~mage Process. t9, 2 (June), 129-147.]]

[101]

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.]]

[102]

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.]]

[103]

MERRILL, R. D. 1973. Representations of contours and regions for efficient computer search. Cornmun. ACM 16, 2 (Feb.), 69-82.]]

[104]

MILFORD, D. J., AND WILLIS, P. C. 1984. Quad encoded display. IEE Proc. 131, E3 (May), 70- 75.]]

[105]

MINSKY, M., AND PAPERT, S. 1969. Perceptrons: An Introduction to Computational Geometry. M.I.T. Press, Cambridge, Mass.]]

[106]

MORTON, G. M. 1966. A computer oriented geodetic data base and a new technique in file sequencing. Unpublished manuscript, iBM, Ltd., Ottawa, Canada.]]

[107]

MUDUR, S. P., AND KOPARKAR, P. A. 1984. Interval methods for processing geometric objects. IEEE Comput. Gr. AppL 4, 2 (Feb.), 7-17.]]

[108]

NAGY, G., AND WAGLE, $. 1979. Geographic data processing. ACM Cornput. Surv. 11, 2 (June), 139- 181.]]

[109]

NIEVERGELT, J., AND PREPARATA, F. P. 1982. Planesweep algorithms for intersecting geometric figures. Commun. ACM 25, 10 (Oct.), 739-746.]]

[110]

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.]]

[111]

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.]]

[112]

OLIVER, M. A., AND WISEMAN, N. E. 1983a, Operations on quadtree-encoded images. Comput. J. 26, i (Feb.), 83-91.]]

[113]

OLIVER, M. A., AND WISEMAN, N. E. 1983b. Operations on quadtree leaves and related image areas. Comput. J. 26, 4 (Nov.), 375-380.]]

[114]

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.]]

[115]

ORE.NSTEIN, J. A. 1982. Multidimensional tries used for associative searching. Inf. Process. Lett. 14, 4 (June), 150-157.]]

[116]

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.]]

[117]

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.]]

[118]

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.]]

[119]

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.]]

[120]

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.]]

[121]

OVRRMARS, M. H. 1983. The Design of Dynamic Data Structures, Lecture Notes in Computer Science, vol. 156. Springer-Verlag, New York.]]

[122]

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.]]

[123]

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.]]

[124]

PEUCKER, T. 1976. A theory of the cartographic line, int. Yearb. Cartogr. 16, 34--43.]]

[125]

PEUQUET, D. J. 1979. Raster processing: An alternative approach to automated cartographic data handling. Am. Cartogr. 2 {Apr.), 129-239.]]

[126]

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.]]

[127]

PFALTZ, J. L., AND ROSENFELD, A. 1967. Computer representation of planar regions by their skeletons. Commun. ACM t0, 2 (Feb.), 119-122.]]

[128]

PIETIKAINEN, M., ROSENFELD, A., AND WALTER, I. 1982. Split-and-link algorithms for image segmentation. Pattern Recognition 15, 4, 287-298.]]

[129]

RAMAN, V., AND IYENGAR, S. S. 1983. Properties and applications of forests of quadtrees for pictorial data representation. BIT 23, 4, 472-486.]]

[130]

RANADE, S. 1981. Use of quadtrees for edge enhancemeat. IEEE Trans. Syst. Man, Cybern. 11, 5 (May), 370-373.]]

[131]

RANADE, S., ANO SHeEtER, M. 1981. Using quadtrees to smooth images. IEEE Trans. Syst. Man Cybern. 11, 5 (May), 373-376.]]

[132]

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.]]

[133]

RANADE, $., ROSENFELD, A., AND SAMET, H. 1982. Shape approximation using quadtrees. Pattern Recognition 15, 1, 31-40.]]

[134]

REDDY, D. R., AND RUBIN, S. 1978. Representation of three-dimensional objects. CMU-CS-78-113, Computer Science Dept., Carnegie-Mellon University, Pittsburgh, Apr.]]

[135]

REQUICHA, A. A. G. 1980. Representations of rigid solids: Theory, methods, and systems. ACM Comput. Surv. 12, 4 (Dec.), 437-464.]]

[136]

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.]]

[137]

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.]]

[138]

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.]]

[139]

ROSENFELD, A., ED. 1983. Muitiresolution Image Processing and Analysis. Springer-Verlag, Berlin and New York.]]

[140]

ROSENFELD, A. 1984. Picture processing 1984. Cornput. Vision Gr. Image Process. 26, 3 (June), 347- 384.]]

[141]

ROSENFELD, A., ANO KAK, A. C. 1982. Digital Picture Processing, 2nd ed. Academic Press, New York.]]

[142]

ROSENFELD, A., A~D PFALTZ, J. L. 1966. Sequential operations in digital image processing. J. ACM 13, 4 (Oct.), 471-494.]]

[143]

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.]]

[144]

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.]]

[145]

ROTH, S. D. 1982. Ray casting for modeling solids. Comput. Gr. Image Process. {8, 2 (Feb.), 109-144.]]

[146]

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.]]

[147]

SAMET, H. 1980a. Region representation: Quadtrees from boundary codes. Cornmun. A CM 23, 3 (Mar.), 163-170.]]

[148]

SAMET, H. 1980b, Region representation: Quadtrees from binary arrays. Comput. Gr. Image Process. t3, 1 (May), 88-93.]]

[149]

SAMET, H. 1980c. Deletion in two-dimensional quad trees. Commun. ACM 23, 12 (Dec.), 703-710.]]

[150]

SAMET, H. 1981a. An algorithm for converting rasters to quadtrees. IEEE Trans. Pattern Anal. Mech. lnteU. 3, 1 (Jan.), 93-95.]]

[151]

SAMET, H. 1981b. Connected component labeling using quadtrees. J. ACM 28, 3 (July), 487-501.]]

[152]

SAMET, H. 1981c. Computing perimeters of images represented by quadtrees. IEEE Trans. Pattern Anal. Mactr lntell. 3, 6 (Nov.), 683-687.]]

[153]

SAMET, H. 1982a. Neighbor finding techniques for images represented by quadtrees. Comput. Gr. Image Process. 18, 1 (Jan.), 37~57.]]

[154]

SAMET, H. 1982b. Distance transform for images represented by quadtrees, iEEE Trans. Pattern Anal Mech. lntell. 4, 3 (May), 298-303.]]

[155]

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.]]

[156]

SAMET, H. 1984. Algorithms for ~he conversion of quadtrees to rasters. Comput. Vision Gr. Image Process. 26, 1 (Apr.), 1-16.]]

[157]

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.]]

[158]

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.]]

[159]

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.]]

[160]

SAMET, H., AND KRISHNAMURTHY, E. V. 1983. A quadtree-based matrix manipulation system. Unpublished manuscript of work in progress.]]

[161]

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.]]

[162]

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.]]

[163]

SAMET, H., A~D TAMbIINE~I, M. 1984. Efficient image component labeling. TR-1420, Computer Science Dept., University of Maryland, College Park, Md., July.]]

[164]

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.]]

[165]

SAMET, H., AND WEBBER, R. E. 1982. On encoding boundaries with quadtrees. TR-1162, Computer Science Dept., University of Maryland, College Park, Md., Feb.]]

[166]

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.]]

[167]

SAMET, H., ANO WEBBER, R. E. 1984. On encoding boundaries with quadtrees. IEEE Trans. Pattern Anal. Mech. InteU. 6, 3 (May), 365-369.]]

[168]

SHAMOS, M. L, 1978. Computational geometry. Ph.D. dissertation, Dept. of Computer Science, Yale University, New Haven, Conn.]]

[169]

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.]]

[170]

SHNEIER, M. 198Ia. Calculations of geometric properties using quadtrees. Comput. Gr. Image Process. 16, 3 (July), 296-302.]]

[171]

SHNEIER, M. 1981b. Path-length distances for quadtrees. Inf. Sci. 23, I (Feb.), 49-67.]]

[172]

SHNEIER, M. 1981c. Two hierarchical linear feature representations: Edge pyramids and edge quadtrees. Comput. Gr. Image Process. 17, 3 (Nov.), 211-224.]]

[173]

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.]]

[174]

SLOAN, K. R., JR., AND TANIMOTO, S. L. 1979. Progressive refinement of raster images. 1EEE Trans. Comput. 28, 11 (Nov.), 871-874.]]

[175]

SRIHARI, S. N. 1981. Representation ofthree-dimensional digital images. ACM Comput. Surv. 13, 1 (Dec.), 399-424.]]

[176]

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.]]

[177]

TAMMINgN, M. 1981. The EXCELL method for eL ficient geometric access to data. Acta Potytech. Scand. Mathematics and Computer Science Series No. 34, Helsinki,]]

[178]

TAMMINEN, M. 1982. Hidden lines using the EX- CELL method. Comput. Gr. Forum l 1, 3, 96-105.]]

[179]

TAMMINRN, M. 1983. Performance analysis of cell based geometric file organizations. Comput. Vision Gr. Image Process. 24, 2 (Nov.), 168-181.]]

[180]

TAMMINEN, M. 1984a. Comment on quad- and octtrees. Commun. ACM 27, 3 (Mar.), 248-249.]]

[181]

TAMMIN~2N, M. 1984b. Encoding pixel trees. Cornput. Vision Gr. Image Process. 28, 1 (Oct.), 44-57.]]

[182]

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.]]

[183]

TANIMOTO, S. 1976. Pictorial feature distortion in a pyramid. Comput. Gr. Image Process. 5, 3 (Sept.), 333-352.]]

[184]

TANIMOTO, S. 1979. Image transmission with gross information first. Comput. Graph. Image Process. 9, 1 (Jan.), 72-76.]]

[185]

TANIMOTO, S., AND KLINGER, A. EDS. 1980. Structured Computer Vision. Academic Press, New York.]]

[186]

TANIMOTO, S., AND PAVLIDIS, T. 1975. A hierarchical data structure for picture processing. Comput. Gr. Image Process. 4, 2 (June), 104-119.]]

[187]

TARJAN, R. E. 1975. Efficiency of a good but not linear set union algorithm. J. ACM 22, 2 (Apr.), 215-225.]]

[188]

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.]]

[189]

TROPF, H., AND Ht~RZOG, H. 1981. Multidimensional range search in dynamically balanced trees. Angew. Inf. 2, 71-77.]]

[190]

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.]]

[191]

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.]]

[192]

UHR, L. 1972. Layered "recognition cone" networks that preprocess, classify, and describe, iEEE Trans. Compu~ 21, 7 (July), 758-768.]]

[193]

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.]]

[194]

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.]]

[195]

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.]]

[196]

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.]]

[197]

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.]]

[198]

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.]]

[199]

WILLARD, D. E. 1982. Polygon retrieval. SIAM J. Comput. 1I, I (Feb.), 149-165.]]

[200]

WOODWARK, J. R. 1982. The explicit quadtree as a structure for computer graphics. Comput. J. 25, 2 (May), 235-238.]]

[201]

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.]]

[202]

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.]]

[203]

YAU, M. 1984. Generating quadtrees of cross-sections from octrees. Comput. Vision Gr. image Process. 27, 2 (Aug.), 211-238.]]

[204]

YAU, M., A~D SP~Agl, S. N. 1983. A hierarchical data structure for multidimensional digital iraages. Commun. ACM 26, 7 (July), 504-515.]]

[205]

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.]]

Information & Contributors

Information

Published In

cover image ACM Computing Surveys

ACM Computing Surveys Volume 16, Issue 2

June 1984

161 pages

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]

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 01 June 1984

Published in CSUR Volume 16, Issue 2

Permissions

Request permissions for this article.

Check for updates

Qualifiers

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

Reflects downloads up to 10 Nov 2024

Other Metrics

Citations

View Options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Get Access

Login options

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

Sign in

Full Access

Media

Figures

Other

Tables

Affiliations

Hanan Samet

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