The Quadtree and Related Hierarchical Data Structures
Tóm tắt
Từ khóa
Tài liệu tham khảo
AHO , A. V. , HOPCROFT , J. E. , AND ULLMAN , J. D. 1974. The Design and Analysis of Computer Algorithms . Addison-Wesley , Reading, Mass .]] AHO, A. V., HOPCROFT, J. E., AND ULLMAN, J. D. 1974. The Design and Analysis of Computer Algorithms. Addison-Wesley, Reading, Mass.]]
AHUJA , N. 1983 . On approaches to polygonal decomposition for hierarchical image representation . Comput. Vision Gr. Image Process. 24 , 2 (Nov.) 200-214.]] AHUJA, N. 1983. On approaches to polygonal decomposition for hierarchical image representation. Comput. Vision Gr. Image Process. 24, 2 (Nov.) 200-214.]]
AHUJA , N. , AND NASH , C. 1984 . Octree representations of moving objects . Comput. Vision Gr. Image Process. 26 , 2 (May), 207-216.]] AHUJA, N., AND NASH, C. 1984. Octree representations of moving objects. Comput. Vision Gr. Image Process. 26, 2 (May), 207-216.]]
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.]] 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.]]
BENTLEY , J. L. , AND STANAT , D. F. 1975 . Analysis of range searches in quad trees . Inf. Process. Lett. 3 , 6 (july), 170-173.]] BENTLEY, J. L., AND STANAT, D. F. 1975. Analysis of range searches in quad trees. Inf. Process. Lett. 3, 6 (july), 170-173.]]
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 .]] 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.]]
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 .]] 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.]]
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 .]] 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.]]
BURT , P. J. , HONO , T. H. , AND ROSEN r ELO , A. 1981 . Segmentation and estimation of image region properties through cooperative hierarchical computation . IEEE Trans. Syst. Man Cybern. ! I , 12 (Dec.), 802-809.]] 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.]]
CHIEN , C. H. , AND AGGARWAL , J. K. 1984 . A normalized quadtree representation . Cornput. Vision Gr. Image Process. 26 , 3 (June), 331-346.]] CHIEN, C. H., AND AGGARWAL, J. K. 1984. A normalized quadtree representation. Cornput. Vision Gr. Image Process. 26, 3 (June), 331-346.]]
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.]] 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.]]
COMER D. 1979. The ubiquitous B-tree. ACM Comput~ Surv. 11 2 (June) 121-137.]] 10.1145/356770.356776 COMER D. 1979. The ubiquitous B-tree. ACM Comput~ Surv. 11 2 (June) 121-137.]] 10.1145/356770.356776
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 .]] 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.]]
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.]] 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.]]
DEFLORIANI , L. , FALC iD IENO , 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 .]] 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.]]
DOCTOR , L. J. , AND TO ,BOa(;, J. G. 1981 . Display techniques for octree-encoded objects . IEEE Comput. Gr. Appl. 1 , 1 (July), 39-46.]] DOCTOR, L. J., AND TO,BOa(;, J. G. 1981. Display techniques for octree-encoded objects. IEEE Comput. Gr. Appl. 1, 1 (July), 39-46.]]
DUDA , R. O. , AND HART , P. E. 1973. Pattern Classification and Scene Analysis . Wiley , New York .]] DUDA, R. O., AND HART, P. E. 1973. Pattern Classification and Scene Analysis. Wiley, New York.]]
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 .]] 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.]]
DYER , C. R. 1982 . The space efficiency of quadtrees . Comput. Gr. Image Process. I9 , 4 (Aug.), 335-348.]] DYER, C. R. 1982. The space efficiency of quadtrees. Comput. Gr. Image Process. I9, 4 (Aug.), 335-348.]]
DYER C. R. ROSENFELO A. AND SAMET H. t980. Region representation: Boundary codes from quadtrees. Commun. ACM 23 3 (Mar.) 171- 179.]] 10.1145/358826.358838 DYER C. R. ROSENFELO A. AND SAMET H. t980. Region representation: Boundary codes from quadtrees. Commun. ACM 23 3 (Mar.) 171- 179.]] 10.1145/358826.358838
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.]] 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.]]
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.]] 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.]]
EDELSBRUNNER , H. , GUIBAS , L. J. , AND STOLFI , J. 1985. Optimal point location in a monotone subdivision . SIAM J. Comput. in press.]] 10.1137/0215023 EDELSBRUNNER, H., GUIBAS, L. J., AND STOLFI, J. 1985. Optimal point location in a monotone subdivision. SIAM J. Comput. in press.]] 10.1137/0215023
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 .]] 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.]]
FAUGERAS , O. D. , HESF . RT, M ., MUSSL P. , a~r~ BOIS - 8O NNAT , J. D. 1984 . Polyhedral approximation of 3-d objects without holes . Comput. Vision Gr. Image Process. 25 , 2 (Feb.), 169-183.]] 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.]]
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 .]] 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.]]
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.]] 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.]]
FREEMAN H. 1974. Computer processing of linedrawing images. ACM Comput. Surv. 6 i (Mar.) 57-97.]] 10.1145/356625.356627 FREEMAN H. 1974. Computer processing of linedrawing images. ACM Comput. Surv. 6 i (Mar.) 57-97.]] 10.1145/356625.356627
GASTON , P. C. , AN t} LOzANO-P EREZ , 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.]] 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.]]
GIBSON , L. , A~O LVCAS , D. 1982 . Vectorization of raster images using hierarchical methods . Comput. Gr. Image Proces& 20 , 1 (Sept.), 82-89.]] GIBSON, L., A~O LVCAS, D. 1982. Vectorization of raster images using hierarchical methods. Comput. Gr. Image Proces& 20, 1 (Sept.), 82-89.]]
GILLESP t E, 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 .]] 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.]]
GOMEZ , D. , AND GUZMAN , A. 1979 . Digital model for three-dimensional surface representation . Gee-Process. 1 , 53 - 70 .]] GOMEZ, D., AND GUZMAN, A. 1979. Digital model for three-dimensional surface representation. Gee-Process. 1, 53-70.]]
GROSKY , W. I. , AN n Jam, R. 1983 . Optimal quadtrees for image segments . IEEE Trans. Pattern Anal Mach. InteU. 5 , 1 (Jan.), 77--83.]] GROSKY, W. I., ANn Jam, R. 1983. Optimal quadtrees for image segments. IEEE Trans. Pattern Anal Mach. InteU. 5, 1 (Jan.), 77--83.]]
HARARY , F. 1969. Graph Theory . Addison-Wesley , Reading, Mass .]] HARARY, F. 1969. Graph Theory. Addison-Wesley, Reading, Mass.]]
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 .]] 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.]]
HINRICHS , K. , ^No Nm WR t~ ELT , J. 1983. The Grid File: A data structure to support proximity queries on spatial objects. Rep. 54 , Institut fur Informatik, ETH, Zurich , July.]] 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.]]
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.]] 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.]]
HUNTER , G. M. , A~D STF . IC , LI ? Z, K . 1979 a. Operations on images using quad trees . IEEE Trans. Pattern Anal. Mach. {ntell. 1 , 2 (Apr.), 145-153.]] 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.]]
HUNTER , G. M. , A~D STEIGL 1 TZ, K . 1979 b. Linear transformation of pictures represented by quad trees . Comput. Gr. Image Process. 10 , 3 (July), 289-296.]] 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.]]
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 .]] 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.]]
JACKINS , C. , ^~o TA~ t MOTO , 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.]] 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.]]
JONES , L. , AND IYEN (~ AR , $. S. 1984 . Space and time efficient virtual quadtrees . IEEE Trans. Pattern Anal. Mach. InteU. 6 , 2 (Mar.), 244-247.]] JONES, L., AND IYEN(~AR, $. S. 1984. Space and time efficient virtual quadtrees. IEEE Trans. Pattern Anal. Mach. InteU. 6, 2 (Mar.), 244-247.]]
KAWAGUCHI , E. , Ab JD 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.]] 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.]]
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 .]] 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.]]
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 ]] 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 ]]
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.]] 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.]]
KELLY , M. D. 1971 . Edge detection in pictures by computer using planning . Mach. Intell. 6 , 397 - 409 .]] KELLY, M. D. 1971. Edge detection in pictures by computer using planning. Mach. Intell. 6, 397- 409.]]
KLINGER , A. 1971. Patterns and search statistics . In Optimizing Methods in Statistics, J. S. Rustagi, Ed , Academic Press , New York , pp. 303 - 337 .]] KLINGER, A. 1971. Patterns and search statistics. In Optimizing Methods in Statistics, J. S. Rustagi, Ed, Academic Press, New York, pp. 303-337.]]
KLINGER , A. , AND DYER , C. R. 1976 . Experiments in picture representation using regular decomposition . Comput. Gr. Image Process. 5 , 1 (Mar), 68- 105.]] KLINGER, A., AND DYER, C. R. 1976. Experiments in picture representation using regular decomposition. Comput. Gr. Image Process. 5, 1 (Mar), 68- 105.]]
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.]] 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.]]
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 .]] 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.]]
KNUTH , D. E. 1973. The Art of Computer Programruing , vol. 3 , Sorting and Searching. Addison- Wesley, Reading, Mass .]] KNUTH, D. E. 1973. The Art of Computer Programruing, vol. 3, Sorting and Searching. Addison- Wesley, Reading, Mass.]]
KNUTH , D. E. 1975. The Art of Computer Programming , vol. 1 , Fundamental Algorithms, 2 nd ed. Addison-Wesley , Reading, Mass.]] KNUTH, D. E. 1975. The Art of Computer Programming, vol. 1, Fundamental Algorithms, 2nd ed. Addison-Wesley, Reading, Mass.]]
LAUZON , J. P. , MARK , D. M. , KIKUCH i, 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.]] 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.]]
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.]] 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.]]
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 .]] 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.]]
LI , M. , GROSKY , W. I. , AND JAIN , R. 1982 . Normalized quadtrees with respect to translations . Comput. Gr. Image Procezs. 20 , 1 (Sept.), 72-81.]] LI, M., GROSKY, W. I., AND JAIN, R. 1982. Normalized quadtrees with respect to translations. Comput. Gr. Image Procezs. 20, 1 (Sept.), 72-81.]]
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 .]] 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.]]
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 .]] 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.]]
LUMIA , R. 1983 . A new three-dimensional connected components algorithm . Cornput. Vision Gr. Image Process. 23 , 2 (Aug.), 207-217.]] LUMIA, R. 1983. A new three-dimensional connected components algorithm. Cornput. Vision Gr. Image Process. 23, 2 (Aug.), 207-217.]]
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.]] 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.]]
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 .]] 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.]]
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.]] 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.]]
MCCLUSKEY , E. J. 1965. Introduction to the Theory of Switching Circuits . McGraw-Hill , New York , pp. 60 - 61 .]] MCCLUSKEY, E. J. 1965. Introduction to the Theory of Switching Circuits. McGraw-Hill, New York, pp. 60-61.]]
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 .]] 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.]]
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 .]] 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.]]
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 .]] 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.]]
MILFORD , D. J. , AND WILLIS , P. C. 1984 . Quad encoded display . IEE Proc. 131 , E3 (May), 70- 75.]] MILFORD, D. J., AND WILLIS, P. C. 1984. Quad encoded display. IEE Proc. 131, E3 (May), 70- 75.]]
MINSKY , M. , AND PAPERT , S. 1969 . Perceptrons: An Introduction to Computational Geometry . M.I.T. Press , Cambridge, Mass .]] MINSKY, M., AND PAPERT, S. 1969. Perceptrons: An Introduction to Computational Geometry. M.I.T. Press, Cambridge, Mass.]]
MORTON , G. M. 1966. A computer oriented geodetic data base and a new technique in file sequencing. Unpublished manuscript, iBM , Ltd ., Ottawa, Canada.]] MORTON, G. M. 1966. A computer oriented geodetic data base and a new technique in file sequencing. Unpublished manuscript, iBM, Ltd., Ottawa, Canada.]]
MUDUR , S. P. , AND KOPARKAR , P. A. 1984 . Interval methods for processing geometric objects . IEEE Comput. Gr. AppL 4 , 2 (Feb.), 7-17.]] MUDUR, S. P., AND KOPARKAR, P. A. 1984. Interval methods for processing geometric objects. IEEE Comput. Gr. AppL 4, 2 (Feb.), 7-17.]]
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 .]] 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.]]
OLIVER , M. A. , AND WISEMAN , N. E. 1983 b. Operations on quadtree leaves and related image areas . Comput. J. 26 , 4 (Nov.), 375-380.]] OLIVER, M. A., AND WISEMAN, N. E. 1983b. Operations on quadtree leaves and related image areas. Comput. J. 26, 4 (Nov.), 375-380.]]
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 .]] 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.]]
ORE .NS TEIN , J. A. 1982 . Multidimensional tries used for associative searching . Inf. Process. Lett. 14 , 4 (June), 150-157.]] ORE.NSTEIN, J. A. 1982. Multidimensional tries used for associative searching. Inf. Process. Lett. 14, 4 (June), 150-157.]]
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 .]] 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.]]
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 .]] 10.1145/588011.588037 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.]] 10.1145/588011.588037
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 .]] 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.]]
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.]] 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.]]
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 .]] 10.1145/588058.588071 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.]] 10.1145/588058.588071
OVRRMARS , M. H. 1983. The Design of Dynamic Data Structures , Lecture Notes in Computer Science , vol. 156 . Springer-Verlag , New York .]] OVRRMARS, M. H. 1983. The Design of Dynamic Data Structures, Lecture Notes in Computer Science, vol. 156. Springer-Verlag, New York.]]
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 .]] 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.]]
PEUCKER , T. 1976 . A theory of the cartographic line, int . Yearb. Cartogr. 16 , 34 -- 43 .]] PEUCKER, T. 1976. A theory of the cartographic line, int. Yearb. Cartogr. 16, 34--43.]]
PFALTZ J. L. AND ROSENFELD A. 1967. Computer representation of planar regions by their skeletons. Commun. ACM t0 2 (Feb.) 119-122.]] 10.1145/363067.363120 PFALTZ J. L. AND ROSENFELD A. 1967. Computer representation of planar regions by their skeletons. Commun. ACM t0 2 (Feb.) 119-122.]] 10.1145/363067.363120
RANADE , S. 1981 . Use of quadtrees for edge enhancemeat . IEEE Trans. Syst. Man, Cybern. 11 , 5 (May), 370-373.]] RANADE, S. 1981. Use of quadtrees for edge enhancemeat. IEEE Trans. Syst. Man, Cybern. 11, 5 (May), 370-373.]]
RANADE , S. , ANO SH eEt ER, M . 1981 . Using quadtrees to smooth images . IEEE Trans. Syst. Man Cybern. 11 , 5 (May), 373-376.]] RANADE, S., ANO SHeEtER, M. 1981. Using quadtrees to smooth images. IEEE Trans. Syst. Man Cybern. 11, 5 (May), 373-376.]]
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.]] 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.]]
REDDY , D. R. , AND RUBIN , S. 1978. Representation of three-dimensional objects. CMU-CS-78-113 , Computer Science Dept. , Carnegie-Mellon University , Pittsburgh, Apr .]] REDDY, D. R., AND RUBIN, S. 1978. Representation of three-dimensional objects. CMU-CS-78-113, Computer Science Dept., Carnegie-Mellon University, Pittsburgh, Apr.]]
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.]] 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.]]
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 .]] 10.1145/582318.582321 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.]] 10.1145/582318.582321
ROSENFELD , A. , ED. 1983. Muitiresolution Image Processing and Analysis . Springer-Verlag , Berlin and New York.]] ROSENFELD, A., ED. 1983. Muitiresolution Image Processing and Analysis. Springer-Verlag, Berlin and New York.]]
ROSENFELD , A. 1984 . Picture processing 1984 . Cornput. Vision Gr. Image Process. 26 , 3 (June), 347- 384.]] ROSENFELD, A. 1984. Picture processing 1984. Cornput. Vision Gr. Image Process. 26, 3 (June), 347- 384.]]
ROSENFELD , A. , ANO KAK , A. C. 1982. Digital Picture Processing , 2 nd ed. Academic Press , New York .]] ROSENFELD, A., ANO KAK, A. C. 1982. Digital Picture Processing, 2nd ed. Academic Press, New York.]]
ROSENFELD , A. , SAME ?, H., SHA rrr. 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.]] 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.]]
ROSENFELO , A. , S^ MET , H. , SI~A r F~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.]] 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.]]
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 .]] 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.]]
SAMET , H. 1981 a. An algorithm for converting rasters to quadtrees . IEEE Trans. Pattern Anal. Mech. lnteU. 3 , 1 (Jan.), 93-95.]] SAMET, H. 1981a. An algorithm for converting rasters to quadtrees. IEEE Trans. Pattern Anal. Mech. lnteU. 3, 1 (Jan.), 93-95.]]
SAMET , H. 1981 c. Computing perimeters of images represented by quadtrees . IEEE Trans. Pattern Anal. Mactr lntell. 3 , 6 (Nov.), 683-687.]] SAMET, H. 1981c. Computing perimeters of images represented by quadtrees. IEEE Trans. Pattern Anal. Mactr lntell. 3, 6 (Nov.), 683-687.]]
SAMET H. 1982b. Distance transform for images represented by quadtrees iEEE Trans. Pattern Anal Mech. lntell. 4 3 (May) 298-303.]] SAMET H. 1982b. Distance transform for images represented by quadtrees iEEE Trans. Pattern Anal Mech. lntell. 4 3 (May) 298-303.]]
SAMET , H. 1985 a. 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.]] 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.]]
SAMET , } H. 1985 b. 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.]] 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.]]
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.]] 10.1145/4284.4290 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.]] 10.1145/4284.4290
SAMET H. AND KRISHNAMURTHY E. V. 1983. A quadtree-based matrix manipulation system. Unpublished manuscript of work in progress.]] SAMET H. AND KRISHNAMURTHY E. V. 1983. A quadtree-based matrix manipulation system. Unpublished manuscript of work in progress.]]
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 .]] 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.]]
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.]] 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.]]
SAMET , H. , A~D TAM bIIN E~I , M. 1984. Efficient image component labeling. TR-1420 , Computer Science Dept. , University of Maryland , College Park , Md., July.]] SAMET, H., A~D TAMbIINE~I, M. 1984. Efficient image component labeling. TR-1420, Computer Science Dept., University of Maryland, College Park, Md., July.]]
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 .]] 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.]]
SAMET , H. , AND WEBBER , R. E. 1982. On encoding boundaries with quadtrees. TR-1162 , Computer Science Dept. , University of Maryland , College Park , Md., Feb.]] SAMET, H., AND WEBBER, R. E. 1982. On encoding boundaries with quadtrees. TR-1162, Computer Science Dept., University of Maryland, College Park, Md., Feb.]]
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.]] 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.]]
SAMET , H. , ANO WEBBER , R. E. 1984 . On encoding boundaries with quadtrees . IEEE Trans. Pattern Anal. Mech. InteU. 6 , 3 (May), 365-369.]] SAMET, H., ANO WEBBER, R. E. 1984. On encoding boundaries with quadtrees. IEEE Trans. Pattern Anal. Mech. InteU. 6, 3 (May), 365-369.]]
SHAMOS , M. I. , AN n 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 .]] 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.]]
SHNEIER M. 198Ia. Calculations of geometric properties using quadtrees. Comput. Gr. Image Process. 16 3 (July) 296-302.]] SHNEIER M. 198Ia. Calculations of geometric properties using quadtrees. Comput. Gr. Image Process. 16 3 (July) 296-302.]]
SHNEIER , M. 1981 c. Two hierarchical linear feature representations: Edge pyramids and edge quadtrees . Comput. Gr. Image Process. 17 , 3 (Nov.), 211-224.]] SHNEIER, M. 1981c. Two hierarchical linear feature representations: Edge pyramids and edge quadtrees. Comput. Gr. Image Process. 17, 3 (Nov.), 211-224.]]
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 .]] 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.]]
SLOAN , K. R. , JR ., AND TANIMOTO , S. L. 1979 . Progressive refinement of raster images. 1EEE Trans. Comput. 28 , 11 (Nov.), 871-874.]] SLOAN, K. R., JR., AND TANIMOTO, S. L. 1979. Progressive refinement of raster images. 1EEE Trans. Comput. 28, 11 (Nov.), 871-874.]]
TAMMINgN M. 1981. The EXCELL method for eL ficient geometric access to data. Acta Potytech. Scand. Mathematics and Computer Science Series No. 34 Helsinki ]] TAMMINgN M. 1981. The EXCELL method for eL ficient geometric access to data. Acta Potytech. Scand. Mathematics and Computer Science Series No. 34 Helsinki ]]
TAMMINRN , M. 1983 . Performance analysis of cell based geometric file organizations . Comput. Vision Gr. Image Process. 24 , 2 (Nov.), 168-181.]] TAMMINRN, M. 1983. Performance analysis of cell based geometric file organizations. Comput. Vision Gr. Image Process. 24, 2 (Nov.), 168-181.]]
TAMMIN~ 2 N, M . 1984 b. Encoding pixel trees . Cornput. Vision Gr. Image Process. 28 , 1 (Oct.), 44-57.]] TAMMIN~2N, M. 1984b. Encoding pixel trees. Cornput. Vision Gr. Image Process. 28, 1 (Oct.), 44-57.]]
TAMM i NEN , 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 .]] 10.1145/800031.808576 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.]] 10.1145/800031.808576
TANIMOTO , S. 1976 . Pictorial feature distortion in a pyramid . Comput. Gr. Image Process. 5 , 3 (Sept.), 333-352.]] TANIMOTO, S. 1976. Pictorial feature distortion in a pyramid. Comput. Gr. Image Process. 5, 3 (Sept.), 333-352.]]
TANIMOTO , S. , AND KLINGER , A. EDS. 1980. Structured Computer Vision . Academic Press , New York .]] TANIMOTO, S., AND KLINGER, A. EDS. 1980. Structured Computer Vision. Academic Press, New York.]]
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 .]] 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.]]
TROPF , H. , AND Ht~ RZOG , H. 1981 . Multidimensional range search in dynamically balanced trees . Angew. Inf. 2 , 71 - 77 .]] TROPF, H., AND Ht~RZOG, H. 1981. Multidimensional range search in dynamically balanced trees. Angew. Inf. 2, 71-77.]]
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 .]] 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.]]
UHR , L. 1972 . Layered "recognition cone" networks that preprocess, classify, and describe, iEEE Trans . Compu~ 21 , 7 (July), 758-768.]] UHR, L. 1972. Layered "recognition cone" networks that preprocess, classify, and describe, iEEE Trans. Compu~ 21, 7 (July), 758-768.]]
UNNIKRISHNAN , A. , AN o VENKA TESH , Y. V. 1984. On the conversion of raster to linear quadtrees. Department of Electrical Engineering , Indian Institute of Science, Bangalore , India, May.]] 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.]]
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.]] 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.]]
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 .]] 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.]]
WARNOC g;, 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.]] 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.]]
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.]] 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.]]
WILLARD , D. E. 1982. Polygon retrieval. SIAM J. Comput. 1I , I (Feb.) , 149 - 165 .]] WILLARD, D. E. 1982. Polygon retrieval. SIAM J. Comput. 1I, I (Feb.), 149-165.]]
WOODWARK , J. R. 1982 . The explicit quadtree as a structure for computer graphics . Comput. J. 25 , 2 (May), 235-238.]] WOODWARK, J. R. 1982. The explicit quadtree as a structure for computer graphics. Comput. J. 25, 2 (May), 235-238.]]
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.]] 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.]]
YAMAGUCH i, K., KUNII , T. L. , FUJIMURA , K. , AND TORIYA , H. 1984 . Octree-relateddata structures and algorithms . IEEE Comput. Gr. Appl. 4 , 1 (Jan.), 53-59.]] 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.]]
YAU M. 1984. Generating quadtrees of cross-sections from octrees. Comput. Vision Gr. image Process. 27 2 (Aug.) 211-238.]] YAU M. 1984. Generating quadtrees of cross-sections from octrees. Comput. Vision Gr. image Process. 27 2 (Aug.) 211-238.]]