The Quadtree and Related Hierarchical Data Structures

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

The Quadtree and Related Hierarchical Data Structures

Full text

Pdf (4.87 MB)

Source

ACM Computing Surveys (CSUR) archive
Volume 16 , Issue 2 (June 1984) table of contents

Pages: 187 - 260

Year of Publication: 1984

ISSN:0360-0300

Author

Hanan Samet

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

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 100, Downloads (12 Months): 665, Citation Count: 168

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/356924.356930 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked 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	Alfred V. Aho , John E. Hopcroft, The Design and Analysis of Computer Algorithms, Addison-Wesley Longman Publishing Co., Inc., Boston, MA, 1974
	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	D. P. Anderson, Techniques for Reducing Pen Plotting Time, ACM Transactions on Graphics (TOG), v.2 n.3, p.197-212, July 1983 [doi>10.1145/357323.357327]
	7	Dana H. Ballard, Strip trees: a hierarchical representation for curves, Communications of the ACM, v.24 n.5, p.310-321, May 1981 [doi>10.1145/358645.358661]
	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	Jon L Bentley, A survey of techniques for fixed radius near neighbor searching., Stanford University, Stanford, CA, 1975
	10	Jon Louis Bentley, Multidimensional binary search trees used for associative searching, Communications of the ACM, v.18 n.9, p.509-517, Sept. 1975 [doi>10.1145/361002.361007]
	11	Jon Louis Bentley , Jerome H. Friedman, Data Structures for Range Searching, ACM Computing Surveys (CSUR), v.11 n.4, p.397-409, Dec. 1979 [doi>10.1145/356789.356797]
	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	Warren Burton, Representation of many-sided polygons and polygonal lines for rapid processing, Communications of the ACM, v.20 n.3, p.166-171, March 1977 [doi>10.1145/359436.359445]
	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	Wayne E. Carlson, An algorithm and data structure for 3D object synthesis using surface patch intersections, Proceedings of the 9th annual conference on Computer graphics and interactive techniques, p.255-263, July 26-30, 1982, Boston, Massachusetts, United States
	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	Douglas Comer, Ubiquitous B-Tree, ACM Computing Surveys (CSUR), v.11 n.2, p.121-137, June 1979 [doi>10.1145/356770.356776]
	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	Richard A. DeMillo , Stanley C. Eisenstat , Richard J. Lipton, Preserving average proximity in arrays, Communications of the ACM, v.21 n.3, p.228-231, March 1978 [doi>10.1145/359361.359447]
	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	Charles R. Dyer , Azriel Rosenfeld , Hanan Samet, Region representation: boundary codes from quadtrees, Communications of the ACM, v.23 n.3, p.171-179, March 1980 [doi>10.1145/358826.358838]
	38	Charles M. Eastman, Representations for space planning, Communications of the ACM, v.13 n.4, p.242-250, April 1970 [doi>10.1145/362258.362281]
	39	Herbert Edelsbrunner, Key-Problems and Key-Methods in Computational Geormetry, Proceedings of the Symposium of Theoretical Aspects of Computer Science, p.1-13, April 11-13, 1984
	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	Herbert Edelsbrunner , Lionidas J Guibas , Jorge Stolfi, Optimal point location in a monotone subdivision, SIAM Journal on Computing, v.15 n.2, p.317-340, May 1986 [doi>10.1137/0215023]
	42	Ronald Fagin , Jurg Nievergelt , Nicholas Pippenger , H. Raymond Strong, Extendible hashing—a fast access method for dynamic files, ACM Transactions on Database Systems (TODS), v.4 n.3, p.315-344, Sept. 1979 [doi>10.1145/320083.320092]
	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	Edward Fredkin, Trie memory, Communications of the ACM, v.3 n.9, p.490-499, September 1960 [doi>10.1145/367390.367400]
	48	Herbert Freeman, Computer Processing of Line-Drawing Images, ACM Computing Surveys (CSUR), v.6 n.1, p.57-97, March 1974 [doi>10.1145/356625.356627]
	49	Jerome H. Freidman , Jon Louis Bentley , Raphael Ari Finkel, An Algorithm for Finding Best Matches in Logarithmic Expected Time, ACM Transactions on Mathematical Software (TOMS), v.3 n.3, p.209-226, Sept. 1977 [doi>10.1145/355744.355745]
	50	Irene Gargantini, An effective way to represent quadtrees, Communications of the ACM, v.25 n.12, p.905-910, Dec 1982 [doi>10.1145/358728.358741]
	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	Stefan Hertel , Kurt Mehlhorn, Fast Triangulation of Simple Polygons, Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory, p.207-218, August 21-27, 1983
	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	Steven L. Horowitz , Theodosios Pavlidis, Picture Segmentation by a Tree Traversal Algorithm, Journal of the ACM (JACM), v.23 n.2, p.368-388, April 1976 [doi>10.1145/321941.321956]
	63	HUFFMAN, D. A. 1952. A method for the construction of minimum-redundancy codes. Proc. IRE 40, 9 (Sept.), 1098-1101.
	64	Gregory Michael Hunter, Efficient computation and data structures for graphics., 1978
	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	Donald E. Knuth, The art of computer programming, volume 3: (2nd ed.) sorting and searching, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1998
	84	Donald E. Knuth, The art of computer programming, volume 1 (3rd ed.): fundamental algorithms, Addison Wesley Longman Publishing Co., Inc., Redwood City, CA, 1997
	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	R. D. Merrill, Representation of contours and regions for efficient computer search, Communications of the ACM, v.16 n.2, p.69-82, Feb. 1973 [doi>10.1145/361952.361956]
	104	MILFORD, D. J., AND WILLIS, P. C. 1984. Quad encoded display. IEE Proc. 131, E3 (May), 70- 75.
	105	Perceptrons: An Introduction to Computational Geometry, The MIT Press, 1969
	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	George Nagy , Sharad Wagle, Geographic Data Processing, ACM Computing Surveys (CSUR), v.11 n.2, p.139-181, June 1979 [doi>10.1145/356770.356777]
	109	J. Nievergelt , F. P. Preparata, Plane-sweep algorithms for intersecting geometric figures, Communications of the ACM, v.25 n.10, p.739-747, Oct 1982 [doi>10.1145/358656.358681]
	110	J. Nievergelt , Hans Hinterberger , Kenneth C. Sevcik, The Grid File: An Adaptable, Symmetric Multikey File Structure, ACM Transactions on Database Systems (TODS), v.9 n.1, p.38-71, March 1984 [doi>10.1145/348.318586]
	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	Jack A. Orenstein, A Dynamic Hash File for Random and Sequential Accessing, Proceedings of the 9th International Conference on Very Large Data Bases, p.132-141, October 31-November 02, 1983
	117	J. A. Orenstein , T. H. Merrett, A class of data structures for associative searching, Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems, April 02-04, 1984, Waterloo, Ontario, Canada [doi>10.1145/588011.588037]
	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	Mohamed Ouksel , Peter Scheuermann, Storage mappings for multidimensional linear dynamic hashing, Proceedings of the 2nd ACM SIGACT-SIGMOD symposium on Principles of database systems, March 21-23, 1983, Atlanta, Georgia [doi>10.1145/588058.588071]
	121	Mark H. Overmars, Design of Dynamic Data Structures, Springer-Verlag New York, Inc., Secaucus, NJ, 1987
	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	John L. Pfaltz , Azriel Rosenfeld, Computer representation of planar regions by their skeletons, Communications of the ACM, v.10 n.2, p.119-122, Feb. 1967 [doi>10.1145/363067.363120]
	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	Aristides G. Requicha, Representations for Rigid Solids: Theory, Methods, and Systems, ACM Computing Surveys (CSUR), v.12 n.4, p.437-464, Dec. 1980 [doi>10.1145/356827.356833]
	136	Werner C. Rheinboldt , Charles K. Mesztenyi, On a Data Structure for Adaptive Finite Element Mesh Refinements, ACM Transactions on Mathematical Software (TOMS), v.6 n.2, p.166-187, June 1980 [doi>10.1145/355887.355891]
	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	John T. Robinson, The K-D-B-tree: a search structure for large multidimensional dynamic indexes, Proceedings of the 1981 ACM SIGMOD international conference on Management of data, April 29-May 01, 1981, Ann Arbor, Michigan [doi>10.1145/582318.582321]
	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	Azriel Rosenfeld , Avinash C. Kak, Digital Picture Processing, Academic Press, Inc., Orlando, FL, 1982
	142	Azriel Rosenfeld , John L. Pfaltz, Sequential Operations in Digital Picture Processing, Journal of the ACM (JACM), v.13 n.4, p.471-494, Oct. 1966 [doi>10.1145/321356.321357]
	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	Hanan Samet, Region representation: quadtrees from boundary codes, Communications of the ACM, v.23 n.3, p.163-170, March 1980 [doi>10.1145/358826.358836]
	148	SAMET, H. 1980b, Region representation: Quadtrees from binary arrays. Comput. Gr. Image Process. t3, 1 (May), 88-93.
	149	Hanan Samet, Deletion in two-dimensional quad trees, Communications of the ACM, v.23 n.12, p.703-710, Dec. 1980 [doi>10.1145/359038.359043]
	150	SAMET, H. 1981a. An algorithm for converting rasters to quadtrees. IEEE Trans. Pattern Anal. Mech. lnteU. 3, 1 (Jan.), 93-95.
	151	Hanan Samet, Connected Component Labeling Using Quadtrees, Journal of the ACM (JACM), v.28 n.3, p.487-501, July 1981 [doi>10.1145/322261.322267]
	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	Hanan Samet, A quadtree medial axis transform, Communications of the ACM, v.26 n.9, p.680-693, Sept. 1983 [doi>10.1145/358172.358409]
	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	Hanan Samet, Data structures for quadtree approximation and compression, Communications of the ACM, v.28 n.9, p.973-993, Sept. 1985 [doi>10.1145/4284.4290]
	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	Michael Ian Shamos, Computational geometry., 1978
	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	Sargur N. Srihari, Representation of Three-Dimensional Digital Images, ACM Computing Surveys (CSUR), v.13 n.4, p.399-424, Dec. 1981 [doi>10.1145/356859.356862]
	176	Ivan E. Sutherland , Robert F. Sproull , Robert A. Schumacker, A Characterization of Ten Hidden-Surface Algorithms, ACM Computing Surveys (CSUR), v.6 n.1, p.1-55, March 1974 [doi>10.1145/356625.356626]
	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	Markku Tamminen, Comment on Quad- and Octtrees, Communications of the ACM, v.27 n.3, p.248-249, March 1984 [doi>10.1145/357994.358026]
	181	TAMMIN~2N, M. 1984b. Encoding pixel trees. Cornput. Vision Gr. Image Process. 28, 1 (Oct.), 44-57.
	182	Markku Tamminen , Hanan Samet, Efficient octree conversion by connectivity labeling, Proceedings of the 11th annual conference on Computer graphics and interactive techniques, p.43-51, January 1984
	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	Robert Endre Tarjan, Efficiency of a Good But Not Linear Set Union Algorithm, Journal of the ACM (JACM), v.22 n.2, p.215-225, April 1975 [doi>10.1145/321879.321884]
	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	Lewis Wiley Tucker, Computer vision using quadtree refinement (artificial intelligence, segmentation, knowledge), 1984
	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	Robert Edward Webber, Analysis of quadtree algorithms (graphics), 1983
	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	Mann-May Yau , Sargur N. Srihari, A hierarchical data structure for multidimensional digital images, Communications of the ACM, v.26 n.7, p.504-515, July 1983 [doi>10.1145/358150.358158]
	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.

CITED BY 168

	Steven H. Gutfreund, Maniplicons in ThinkerToy, ACM SIGPLAN Notices, v.22 n.12, p.307-317, Dec. 1987
	Iosif Lazaridis , Sharad Mehrotra, Progressive approximate aggregate queries with a multi-resolution tree structure, ACM SIGMOD Record, v.30 n.2, p.401-412, June 2001
	D. S. Guru , P. Punitha , P. Nagabhushan, Archival and retrieval of symbolic images: an invariant scheme based on triangular spatial relationship, Pattern Recognition Letters, v.24 n.14, p.2397-2408, October 2003
	G. Costagliola , G. Tortora , T. Arndt, A Unifying Approach to Iconic Indexing for 2-D and 3-D Scenes, IEEE Transactions on Knowledge and Data Engineering, v.4 n.3, p.205-222, June 1992
	Damon Liu , Mark Burgin , Walter Karplus , Daniel Valentino, Large-scale flow field visualization for aneurysm treatment, Proceedings of the 2001 ACM symposium on Applied computing, p.68-72, March 2001, Las Vegas, Nevada, United States
	Tsz S. Cheng , Shashi K. Gadia , Sunil S. Nair, Object identity and dimension alignment in parametric databases, Proceedings of the second international conference on Information and knowledge management, p.615-624, November 01-05, 1993, Washington, D.C., United States
	Christian A. Duncan , Michael T. Goodrich , Stephen Kobourov, Balanced aspect ratio trees: combining the advantages of k-d trees and octrees, Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms, p.300-309, January 17-19, 1999, Baltimore, Maryland, United States
	Goetz Graefe, Query evaluation techniques for large databases, ACM Computing Surveys (CSUR), v.25 n.2, p.73-169, June 1993
	D. Rotem, Clustered multiattribute hash files, Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.225-234, March 1989, Philadelphia, Pennsylvania, United States
	Richard J. Howarth, Spatial Models for Wide-Area Visual Surveillance: Computational Approaches and Spatial Building-Blocks, Artificial Intelligence Review, v.23 n.2, p.97-155, April 2005
	Volker Gaede , Oliver Günther, Multidimensional access methods, ACM Computing Surveys (CSUR), v.30 n.2, p.170-231, June 1998
	Hanan Samet , Robert E. Webber, Storing a collection of polygons using quadtrees, ACM Transactions on Graphics (TOG), v.4 n.3, p.182-222, July 1985
	Peter Lindstrom , David Koller , William Ribarsky , Larry F. Hodges , Nick Faust , Gregory A. Turner, Real-time, continuous level of detail rendering of height fields, Proceedings of the 23rd annual conference on Computer graphics and interactive techniques, p.109-118, August 1996
	Jay Mookherje , Nagarajan Prabhakaran, Spatial decomposition of a tumor into a minimum number of spherical components, Proceedings of the 1992 ACM/SIGAPP symposium on Applied computing: technological challenges of the 1990's, p.988-992, March 1992, Kansas City, Missouri, United States
	Jack A. Orenstein, Spatial query processing in an object-oriented database system, ACM SIGMOD Record, v.15 n.2, p.326-336, June 1986
	Randal C. Nelson , Hanan Samet, A consistent hierarchical representation for vector data, ACM SIGGRAPH Computer Graphics, v.20 n.4, p.197-206, Aug. 1986
	Ekow J. Otoo, Balanced multidimensional extendible hash tree, Proceedings of the fifth ACM SIGACT-SIGMOD symposium on Principles of database systems, p.100-113, March 24-26, 1986, Cambridge, Massachusetts, United States
	Shu-Xiang Li , Murray H. Loew, The quadcode and its arithmetic, Communications of the ACM, v.30 n.7, p.621-626, July 1987
	Chris Okasaki, From fast exponentiation to square matrices: an adventure in types, ACM SIGPLAN Notices, v.34 n.9, p.28-35, Sept. 1999
	Jyh-Jong Tsay, Searching tree structures on a mesh of processors, Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms, p.114-123, September 1992, Orlando, Florida, United States
	Elefterios A. Melissaratos , Diane L. Souvaine, Coping with inconsistencies: a new approach to produce quality triangulations of polygonal domains with holes, Proceedings of the eighth annual symposium on Computational geometry, p.202-211, June 10-12, 1992, Berlin, Germany
	Ugur Güdükbay , Türker Yilmaz, Stereoscopic View-Dependent Visualization of Terrain Height Fields, IEEE Transactions on Visualization and Computer Graphics, v.8 n.4, p.330-345, October 2002
	D. A. Beckley , M. W. Evens , V. K. Raman, Multikey retrieval from K-d trees and QUAD-trees, ACM SIGMOD Record, v.14 n.4, p.291-301, May 1985
	Edgar Chávez , Gonzalo Navarro , Ricardo Baeza-Yates , José Luis Marroquín, Searching in metric spaces, ACM Computing Surveys (CSUR), v.33 n.3, p.273-321, September 2001
	Hanan Samet , Markku Tamminen, Bintrees, CSG trees, and time, ACM SIGGRAPH Computer Graphics, v.19 n.3, p.121-130, Jul. 1985
	Christos Faloutsos , Timos Sellis , Nick Roussopoulos, Analysis of object oriented spatial access methods, ACM SIGMOD Record, v.16 n.3, p.426-439, Dec. 1987
	Yung-Kuan Chan , Chin-Chen Chang, An efficient data structure for storing similar binary images, Information organization and databases: foundations of data organization, Kluwer Academic Publishers, Norwell, MA, 2000
	S. K. Nandy , L. V. Ramakrishnan, Dual quadtree representation for VLSI designs, Proceedings of the 23rd ACM/IEEE conference on Design automation, p.663-666, July 1986, Las Vegas, Nevada, United States
	Thomas J. Sager , William M. Pugh, A CAD system for the capture of combat casualty care information, Proceedings of the 1988 ACM sixteenth annual conference on Computer science, p.131-135, February 1988, Atlanta, Georgia, United States
	Daniel A. Keim , Annemarie Herrmann, The Gridfit algorithm: an efficient and effective approach to visualizing large amounts of spatial data, Proceedings of the conference on Visualization '98, p.181-188, October 18-23, 1998, Research Triangle Park, North Carolina, United States
	J. A. Orenstein, Redundancy in spatial databases, ACM SIGMOD Record, v.18 n.2, p.295-305, June 1989
	Kai Xu, Database support for multiresolution terrain visualization, Proceedings of the fourteenth Australasian database conference, p.153-160, February 01, 2003, Adelaide, Australia
	Quentin F. Stout , Darren L. De Zeeuw , Tamas I. Gombosi , Clinton P. T. Groth , Hal G. Marshall , Kenneth G. Powell, Adaptive blocks: a high performance data structure, Proceedings of the 1997 ACM/IEEE conference on Supercomputing (CDROM), p.1-10, November 15-21, 1997, San Jose, CA
	Hanan Samet, Data structures for quadtree approximation and compression, Communications of the ACM, v.28 n.9, p.973-993, Sept. 1985
	Pere Brunet , Isabel Navazo, Solid representation and operation using extended octrees, ACM Transactions on Graphics (TOG), v.9 n.2, p.170-197, April 1990
	Markku Tamminen , Hanan Samet, Efficient octree conversion by connectivity labeling, ACM SIGGRAPH Computer Graphics, v.18 n.3, p.43-51, July 1984
	C. Eastman, File organizations & incrementally specified queries, Proceedings of the 10th annual international ACM SIGIR conference on Research and development in information retrieval, p.217-222, June 03-05, 1987, New Orleans, Louisiana, United States
	Michiel De Wilde , Dirk Stroobandt , Jan Van Campenhout, AQUASUN: adaptive window query processing in CAD applications for physical design and verification, Proceedings of the 12th ACM Great Lakes symposium on VLSI, April 18-19, 2002, New York, New York, USA
	Randal C. Nelson , Hanan Samet, A population analysis for hierarchical data structures, ACM SIGMOD Record, v.16 n.3, p.270-277, Dec. 1987
	Brian Von Herzen , Alan H. Barr , Harold R. Zatz, Geometric collisions for time-dependent parametric surfaces, ACM SIGGRAPH Computer Graphics, v.24 n.4, p.39-48, Aug. 1990
	X. Wu, Adaptive Split-and-Merge Segmentation Based on Piecewise Least-Square Approximation, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.15 n.8, p.808-815, August 1993
	Hanan Samet, Hierarchical representations of collections of small rectangles, ACM Computing Surveys (CSUR), v.20 n.4, p.271-309, Dec. 1988
	Larry Bergman , Henry Fuchs , Eric Grant , Susan Spach, Image rendering by adaptive refinement, ACM SIGGRAPH Computer Graphics, v.20 n.4, p.29-37, Aug. 1986
	David Cline , Parris K. Egbert, Interactive display of very large textures, Proceedings of the conference on Visualization '98, p.343-350, October 18-23, 1998, Research Triangle Park, North Carolina, United States
	John R. Smith , Shih-Fu Chang, VisualSEEk: a fully automated content-based image query system, Proceedings of the fourth ACM international conference on Multimedia, p.87-98, November 18-22, 1996, Boston, Massachusetts, United States
	Christopher B. Jones, Cartographic Name Placement with Prolog, IEEE Computer Graphics and Applications, v.9 n.5, p.36-47, September 1989
	Victor Y. Pan, Univariate polynomials: nearly optimal algorithms for numerical factorization and root-finding, Journal of Symbolic Computation, v.33 n.5, p.701-733, May 2002
	Leila De Floriani, A Pyramidal Data Structure for Triangle-Based Surface Description, IEEE Computer Graphics and Applications, v.9 n.2, p.67-78, March 1989
	B. G. Prasad , K. K. Biswas , S. K. Gupta, Region-based image retrieval using integrated color, shape, and location index, Computer Vision and Image Understanding, v.94 n.1-3, p.193-233, April/May/June 2004
	Yunyue Zhu , Dennis Shasha, Efficient elastic burst detection in data streams, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, August 24-27, 2003, Washington, D.C.
	Michael Vassilakopoulos , Yannis Manolopoulos , Brigitte Kröll, Efficiency analysis of overlapped quadtrees, Nordic Journal of Computing, v.2 n.1, p.70-84, March 1995
	Giri Narasimhan , Martin Zachariasen, Geometric Minimum Spanning Trees via Well-Separated Pair Decompositions, Journal of Experimental Algorithmics (JEA), 6, p.6-es, 2001
	Tsorng-Lin Chia , Kuang-Bor Wang , Lay-Rong Chen , Zen Chen, A parallel algorithm for generating chain code of objects in binary images, Information Sciences—Informatics and Computer Science: An International Journal, v.149 n.4, p.219-234, February 2003
	Young-Koo Lee , Kyu-Young Whang , Yang-Sae Moon , Il-Yeol Song, An aggregation algorithm using a multidimensional file in multidimensional OLAP, Information Sciences: an International Journal, v.152 n.1, p.121-138, June 2003
	Kenji Suzuki , Isao Horiba , Noboru Sugie, Linear-time connected-component labeling based on sequential local operations, Computer Vision and Image Understanding, v.89 n.1, p.1-23, January 2003
	Arie Shoshani, Multidimensionality in statistical, OLAP, and scientific databases, Multidimensional databases: problems and solutions, Idea Group Publishing, Hershey, PA, 2003
	Roger Zimmermann , Wei-Shinn Ku , Wei-Cheng Chu, Efficient query routing in distributed spatial databases, Proceedings of the 12th annual ACM international workshop on Geographic information systems, November 12-13, 2004, Washington DC, USA
	Andy Harter , Andy Hopper , Pete Steggles , Andy Ward , Paul Webster, The anatomy of a context-aware application, Wireless Networks, v.8 n.2/3, p.187-197, March-May 2002
	Shaowen Wang , Marc P. Armstrong, A quadtree approach to domain decomposition for spatial interpolation in grid computing environments, Parallel Computing, v.29 n.10, p.1481-1504, October 2003
	Charles M. Eastman, Vector Versus Raster: a Functional Comparison of Drawing Technologies, IEEE Computer Graphics and Applications, v.10 n.5, p.68-80, September 1990
	Wonik Choi , Bongki Moon , Sukho Lee, Adaptive cell-based index for moving objects, Data & Knowledge Engineering, v.48 n.1, p.75-101, January 2004
	Djaffer Ibaroudene , Raj Acharya, Parallel Display of Objects Represented by Linear Octrees, IEEE Transactions on Parallel and Distributed Systems, v.6 n.1, p.79-85, January 1995
	Michael B. Dillencourt , Hannan Samet , Markku Tamminen, A general approach to connected-component labeling for arbitrary image representations, Journal of the ACM (JACM), v.39 n.2, p.253-280, April 1992
	Y. Cheng , S. S. Iyengar , R. L. Kashyap, A New Method of image Compression Using Irreducible Covers of Maximal Rectangles, IEEE Transactions on Software Engineering, v.14 n.5, p.651-658, May 1988
	Andy Harter , Andy Hopper , Pete Steggles , Andy Ward , Paul Webster, The anatomy of a context-aware application, Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking, p.59-68, August 15-19, 1999, Seattle, Washington, United States
	O. Günther , J. Bilmes, Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation, IEEE Transactions on Knowledge and Data Engineering, v.3 n.3, p.342-356, September 1991
	Jane Wilhelms , Allen Van Gelder, Octrees for faster isosurface generation, ACM Transactions on Graphics (TOG), v.11 n.3, p.201-227, July 1992
	Sanjiv K. Bhatia , Chaman L. Sabharwal, Near perfect hash table for image databases, Proceedings of the 1996 ACM symposium on Applied Computing, p.442-446, February 17-19, 1996, Philadelphia, Pennsylvania, United States
	Damon Liu , Mark Burgin , Walter Karplus , Daniel Valentino, Large-scale flow field visualization for aneurysm treatment, ACM SIGAPP Applied Computing Review, v.9 n.1, Spring 2001
	Alok Choudhary , Sanjay Ranka, Mesh and pyramid algorithms for iconic indexing, Proceedings of the 5th international conference on Supercomputing, p.295-303, June 17-21, 1991, Cologne, West Germany
	Markus H. Gross , Oliver G. Staadt , Roger Gatti, Efficient Triangular Surface Approximations Using Wavelets and Quadtree Data Structures, IEEE Transactions on Visualization and Computer Graphics, v.2 n.2, p.130-143, June 1996
	Michael Lightstone , Sanjit K. Mitra, Quadtree Optimization for Image and Video Coding, Journal of VLSI Signal Processing Systems, v.17 n.2-3, p.215-224, Nov. 1997
	Türker Yilmaz , Uğur Güdükbay , Varol Akman, Modeling and visualization of complex geometric environments, Geometric modeling: techniques, applications, systems and tools, Kluwer Academic Publishers, Norwell, MA, 2004
	Graham F. Carey , M. Anderson , B. Carnes , B. Kirk, Some aspects of adaptive grid technology related to boundary and interior layers, Journal of Computational and Applied Mathematics, v.166 n.1, p.55-86, 1 April 2004
	Witold A. Litwin , Nick Roussopoulos , Gerald Levy , Wang Hong, Trie Hashing with Controlled Load, IEEE Transactions on Software Engineering, v.17 n.7, p.678-691, July 1991
	Wei-Ying Ma , B. S. Manjunath, NeTra: a toolbox for navigating large image databases, Multimedia Systems, v.7 n.3, p.184-198, May 1999
	Peter D. Holmes , Erland R. A. Jungert, Symbolic and Geometric Connectivity Graph Methods for Route Planning in Digitized Maps, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.14 n.5, p.549-565, May 1992
	Hanan Samet , Robert E. Webber, Hierarchical Data Structures and Algorithms for Computer Graphics, IEEE Computer Graphics and Applications, v.8 n.4, p.59-65, 67-75, July 1988
	Hanan Samet , Robert E. Webber, Hierarchical Data Structures and Algorithms for Computer Graphics. Part I., IEEE Computer Graphics and Applications, v.8 n.3, p.48-68, May 1988
	D. R. Fuhrmann, Quadtree Traversal Algorithms for Pointer-Based and Depth-First Representations, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.10 n.6, p.955-960, November 1988
	Brian C. Lovell , Andrew P. Bradley, The Multiscale Classifier, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.18 n.2, p.124-137, February 1996
	Renato Pajarola , Marc Antonijuan , Roberto Lario, QuadTIN: quadtree based triangulated irregular networks, Proceedings of the conference on Visualization '02, October 27-November 01, 2002, Boston, Massachusetts
	J. Srivastava , J. S. E. Tan , V. Y. Lum, TBSAM: An Access Method for Efficient Processing of Statistical Queries, IEEE Transactions on Knowledge and Data Engineering, v.1 n.4, p.414-423, December 1989
	Sören Balko , Ingo Schmitt , Gunter Saake, The Active Vertice method: a performant filtering approach to high-dimensional indexing, Data & Knowledge Engineering, v.51 n.3, p.369-397, December 2004
	Mohamed F. Mokbel , Xiaopeing Xiong , Walid G. Aref, SINA: scalable incremental processing of continuous queries in spatio-temporal databases, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, June 13-18, 2004, Paris, France
	Renato Pajarola , Miguel Sainz , Patrick Guidotti, Confetti: Object-Space Point Blending and Splatting, IEEE Transactions on Visualization and Computer Graphics, v.10 n.5, p.598-608, September 2004
	Jianliang Xu , Baihua Zheng , Wang-Chien Lee , Dik Lun Lee, The D-Tree: An Index Structure for Planar Point Queries in Location-Based Wireless Services, IEEE Transactions on Knowledge and Data Engineering, v.16 n.12, p.1526-1542, December 2004
	A. Unnikrishnan , P. Shankar , Y. V. Venkatesh, Threaded Linear Hierarchical Quadtrees for Computation of Geometric Properties of Binary Images, IEEE Transactions on Software Engineering, v.14 n.5, p.659-665, May 1988
	Steven M. Seitz , Charles R. Dyer, Photorealistic Scene Reconstruction by Voxel Coloring, International Journal of Computer Vision, v.35 n.2, p.151-173, Nov.-Dec. 1999
	Ashraf Aboulnaga , Walid G. Aref, Window Query Processing in Linear Quadtrees, Distributed and Parallel Databases, v.10 n.2, p.111-126, September 2001
	Xian Liu , Wilsun Xu, A Stochastic Programming Approach for Range Query Retrieval Problems, IEEE Transactions on Knowledge and Data Engineering, v.14 n.4, p.867-880, July 2002
	S. K. Chang , C. W. Yan , D. C. Dimitroff , T. Arndt, An Intelligent Image Database System, IEEE Transactions on Software Engineering, v.14 n.5, p.681-688, May 1988
	A. Tabarraei , N. Sukumar, Adaptive computations on conforming quadtree meshes, Finite Elements in Analysis and Design, v.41 n.7-8, p.686-702, April 2005
	Hanan Samet , Markku Tamminen, Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.10 n.4, p.579-586, July 1988
	A. Del Bimbo , M. Campanai , P. Nesi, A Three-Dimensional Iconic Environment for Image Database Querying, IEEE Transactions on Software Engineering, v.19 n.10, p.997-1011, October 1993
	Qin Ding , Maleq Khan , Amalendu Roy , William Perrizo, The P-tree algebra, Proceedings of the 2002 ACM symposium on Applied computing, March 11-14, 2002, Madrid, Spain
	N. Roussopoulos , C. Faloutsos , T. Sellis, An Efficient Pictorial Database System for PSQL, IEEE Transactions on Software Engineering, v.14 n.5, p.639-650, May 1988
	F. Wang, Relational-Linear Quadtree Approach for Two-Dimensional Spatial Representation and Manipulation, IEEE Transactions on Knowledge and Data Engineering, v.3 n.1, p.118-122, March 1991
	Jignesh M. Patel , Yun Chen , V. Prasad Chakka, STRIPES: an efficient index for predicted trajectories, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, June 13-18, 2004, Paris, France
	F. Warren Burton , John (Yannis) G. Kollias, Functional Programming with Quadtrees, IEEE Software, v.6 n.1, p.90-97, January 1989
	Steven P. Callahan , Milan Ikits , Joao L. D. Comba , Claudio T. Silva, Hardware-Assisted Visibility Sorting for Unstructured Volume Rendering, IEEE Transactions on Visualization and Computer Graphics, v.11 n.3, p.285-295, May 2005
	Jun-ichi Aoe, A compendium of key search references, ACM SIGIR Forum, v.24 n.3, p.26-42, Fall 1990
	Xiang-Rong Jiang , Le Gruenwald, Microarray gene expression data association rules mining based on BSC-tree and FIS-tree, Data & Knowledge Engineering, v.53 n.1, p.3-29, April 2005
	Simon Perkins , Patrick Marais, Identification and reconstruction of bullets from multiple X-rays, Proceedings of the 4th international conference on Computer graphics, virtual reality, visualisation and interaction in Africa, January 25-27, 2006, Cape Town, South Africa
	Ryusuke Sagawa , Ko Nishino , Katsushi Ikeuchi, Adaptively Merging Large-Scale Range Data with Reflectance Properties, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.27 n.3, p.392-405, March 2005
	L. de Floriani, Feature Extraction from Boundary Models of Three-Dimensional Objects, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.11 n.8, p.785-798, August 1989
	Annick Montanvert , Peter Meer , Azriel Rosenfeld, Hierarchical Image Analysis Using Irregular Tessellations, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.13 n.4, p.307-316, April 1991
	John F. Karpovich , James C. French , Andrew S. Grimshaw, High performance access to radio astronomy data: a case study, Proceedings of the 7th international conference on Scientific and Statistical Database Management, p.240-249, September 28-30, 1994, Charlottesville, Virginia
	Robert Laurini , Françoise Milleret, Spatial data base queries: relational algebra versus computational geometry, Proceedings of the 4th international conference on Statistical and Scientific Database Management, p.291-313, June 21-23, 1988, Rome, Italy
	Hagit Zabrodsky , Shmuel Peleg , David Avnir, Symmetry as a Continuous Feature, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.17 n.12, p.1154-1166, December 1995
	L. Stringa, A New Set of Constraint-Free Character Recognition Grammars, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.12 n.12, p.1210-1217, December 1990
	Viorica Botea , Daniel Mallett , Mario A. Nascimento , Jörg Sander, PIST: An Efficient and Practical Indexing Technique for Historical Spatio-Temporal Point Data, Geoinformatica, v.12 n.2, p.143-168, June 2008
	F. P. Coenen , B. Beattie , M. J. R. Shave , T. J. M. Bench-Capon , B. M. Diaz, Spatial Reasoning Using the Quad Tesseral Representation, Artificial Intelligence Review, v.12 n.4, p.321-343, Aug. 1, 1998
	Debra A. Lelewer , Daniel S. Hirschberg, Data compression, ACM Computing Surveys (CSUR), v.19 n.3, p.261-296, Sept. 1987
	Yong-Ju Lee , Ho-Hyun Park , Nam-Hee Hong , Chin-Wan Chung, Spatial query processing using object decomposition method, Proceedings of the fifth international conference on Information and knowledge management, p.53-61, November 12-16, 1996, Rockville, Maryland, United States
	C. C. Reyes-Aldasoro , A. Bhalerao, The Bhattacharyya space for feature selection and its application to texture segmentation, Pattern Recognition, v.39 n.5, p.812-826, May, 2006
	Bruce H. McCormick , Brad Busse , Purna Doddapaneni , Zeki Melek , John Keyser, Compression, segmentation, and modeling of filamentary volumetric data, Proceedings of the ninth ACM symposium on Solid modeling and applications, June 09-11, 2004, Genoa, Italy
	Udo Adamy , Michael Hoffmann , József Solymosi , Miloš Stojaković, Coloring octrees, Theoretical Computer Science, v.363 n.1, p.11-17, 25 October 2006
	Sanjoy K. Saha , Amit K. Das , Bhabatosh Chanda, Image retrieval based on indexing and relevance feedback, Pattern Recognition Letters, v.28 n.3, p.357-366, February, 2007
	Navneet Panda , Edward Y. Chang, Efficient top-k hyperplane query processing for multimedia information retrieval, Proceedings of the 14th annual ACM international conference on Multimedia, October 23-27, 2006, Santa Barbara, CA, USA
	Song Lin , Demetrios Zeinalipour-Yazti , Vana Kalogeraki , Dimitrios Gunopulos , Walid A. Najjar, Efficient indexing data structures for flash-based sensor devices, ACM Transactions on Storage (TOS), v.2 n.4, p.468-503, November 2006
	Pankaj Ganguly, Modified Arc tree based hierarchical representation of digital curve, Pattern Recognition Letters, v.27 n.6, p.529-535, 15 April 2006
	Michael Freytag , Vadim Shapiro, B-rep SE: simplicially enhanced boundary representation, Proceedings of the ninth ACM symposium on Solid modeling and applications, June 09-11, 2004, Genoa, Italy
	Artak Amirbekyan , Vladimir Estivill-Castro, The privacy of k-NN retrieval for horizontal partitioned data: new methods and applications, Proceedings of the eighteenth conference on Australasian database, p.33-42, January 30-February 02, 2007, Ballarat, Victoria, Australia
	Ashok Samal , Sanjiv Bhatia , Prasanth Vadlamani , David Marx, Searching satellite imagery with integrated measures, Pattern Recognition, v.42 n.11, p.2502-2513, November, 2009
	ílise Vareilles , Michel Aldanondo , Paul Gaborit, Brief paper: How to take into account piecewise constraints in constraint satisfaction problems, Engineering Applications of Artificial Intelligence, v.22 n.4-5, p.778-785, June, 2009
	Christian S. Jensen , Dan Lin , Beng Chin Ooi, Query and update efficient B⁺-tree based indexing of moving objects, Proceedings of the Thirtieth international conference on Very large data bases, p.768-779, August 31-September 03, 2004, Toronto, Canada
	Young-Koo Lee , Kyu-Young Whang , Yang-Sae Moon , Il-Yeol Song, A one-pass aggregation algorithm with the optimal buffer size in multidimensional OLAP, Proceedings of the 28th international conference on Very Large Data Bases, p.790-801, August 20-23, 2002, Hong Kong, China
	M. Morse , J. M. Patel , W. I. Grosky, Efficient continuous skyline computation, Information Sciences: an International Journal, v.177 n.17, p.3411-3437, September, 2007
	Mohamed F. Mokbel , Xiaopeng Xiong , Moustafa A. Hammad , Walid G. Aref, Continuous Query Processing of Spatio-Temporal Data Streams in PLACE, Geoinformatica, v.9 n.4, p.343-365, December 2005
	Marios Hadjieleftheriou , Erik Hoel , Vassilis J. Tsotras, SaIL: A Spatial Index Library for Efficient Application Integration, Geoinformatica, v.9 n.4, p.367-389, December 2005
	Jun Yang , Qing Li , Liu Wenyin , Yueting Zhuang, Searching for Flash Movies on the Web: A Content and Context Based Framework, World Wide Web, v.8 n.4, p.495-517, December 2005
	Bo Yang , Ali R. Hurson, Similarity-based clustering strategy for mobile ad hoc multimedia databases, Mobile Information Systems, v.1 n.4, p.253-273, December 2005
	Jae-Gil Lee , Kyu-Young Whang , Wook-Shin Han , Il-Yeol Song, The dynamic predicate: integrating access control with query processing in XML databases, The VLDB Journal — The International Journal on Very Large Data Bases, v.16 n.3, p.371-387, July 2007
	Jun Yang , Qing Li , Liu Wenyin , Yueting Zhuang, Content-based retrieval of Flash^TM movies: research issues, generic framework, and future directions, Multimedia Tools and Applications, v.34 n.1, p.1-23, July 2007
	Janet Wiles , Bradley Tonkes, Hyperspace Geography: Visualizing Fitness Landscapes beyond 4D, Artificial Life, v.12 n.2, p.211-216, March 2006
	Jules-Raymond Tapamo, Multi-Scale Image Analysis by Pyramidal Algorithms, Journal of Mathematical Imaging and Vision, v.10 n.1, p.87-95, Jan. 1999
	Bo Yang , Ali R. Hurson , Yu Jiao , Thomas E. Potok, Multimedia Correlation Analysis in Unstructured Peer-to-Peer Networks, Proceedings of the 2006 International Symposium on on World of Wireless, Mobile and Multimedia Networks, p.332-338, June 26-29, 2006
	Bernhard Seeger , Hans-Peter Kriegel, Techniques for Design and Implementation of Efficient Spatial Access Methods, Proceedings of the 14th International Conference on Very Large Data Bases, p.360-371, August 29-September 01, 1988
	Claude Puech , Hussein Yahia, Quadtrees, octrees, hyperoctrees: a unified analytical approach to tree data structures used in graphics, geometric modeling and image processing, Proceedings of the first annual symposium on Computational geometry, p.272-280, June 05-07, 1985, Baltimore, Maryland, United States
	David Koller , Peter Lindstrom , William Ribarsky , Larry F. Hodges , Nick Faust , Gregory Turner, Virtual GIS: A Real-Time 3D Geographic Information System, Proceedings of the 6th conference on Visualization '95, p.94, October 29-November 03, 1995
	Brian Von Herzen , Alan H. Barr, Accurate triangulations of deformed, intersecting surfaces, ACM SIGGRAPH Computer Graphics, v.21 n.4, p.103-110, July 1987
	Markus H. Gross , Roger Gatti , Oliver Staadt, Fast Multiresolution Surface Meshing, Proceedings of the 6th conference on Visualization '95, p.135, October 29-November 03, 1995
	Colin G. Johnson , Duncan Marsh, Modelling robot manipulators with multivariate B-splines, Robotica, v.17 n.3, p.239-247, May 1999
	Jules Bloomenthal , Brian Wyvill, Interactive techniques for implicit modeling, ACM SIGGRAPH Computer Graphics, v.24 n.2, p.109-116, Mar. 1990
	N. Ikonomakis , K. N. Plataniotis , A. N. Venetsanopoulos, Color Image Segmentation for Multimedia Applications, Journal of Intelligent and Robotic Systems, v.28 n.1-2, p.5-20, June 2000
	Yong-Ju Lee , Chin-Wan Chung, The DR-tree: A Main Memory Data Structure for Complex Multi-dimensional Objects, Geoinformatica, v.5 n.2, p.181-207, June 2001
	Cordelia Schmid , Roger Mohr, Local Grayvalue Invariants for Image Retrieval, IEEE Transactions on Pattern Analysis and Machine Intelligence, v.19 n.5, p.530-535, May 1997
	Vasileios Megalooikonomou , Despina Kontos , Dragoljub Pokrajac , Aleksandar Lazarevic , Zoran Obradovic, An adaptive partitioning approach for mining discriminant regions in 3D image data, Journal of Intelligent Information Systems, v.31 n.3, p.217-242, December 2008
	Nesime Tatbul , Uǧur Çetintemel , Stan Zdonik, Staying FIT: efficient load shedding techniques for distributed stream processing, Proceedings of the 33rd international conference on Very large data bases, September 23-27, 2007, Vienna, Austria
	Hweehwa Pang , Kian-Lee Tan, Verifying Completeness of Relational Query Answers from Online Servers, ACM Transactions on Information and System Security (TISSEC), v.11 n.2, p.1-50, March 2008
	Alberto Apostolico , Laxmi Parida , Simona E. Rombo, Motif patterns in 2D, Theoretical Computer Science, v.390 n.1, p.40-55, January, 2008
	M. F. A. Schroders , R. v. Gulik, Quadtree relief mapping, Proceedings of the 21st ACM SIGGRAPH/Eurographics symposium on Graphics hardware, September 03-04, 2006, Vienna, Austria
	F. Perazzo , R. Löhner , L. Perez-Pozo, Adaptive methodology for meshless finite point method, Advances in Engineering Software, v.39 n.3, p.156-166, March, 2008
	Michael Morse , Jignesh M. Patel , William I. Grosky, Efficient evaluation of radial queries using the target tree, International Journal of Bioinformatics Research and Applications, v.3 n.1, p.24-41, December 2007
	Pradeep Mohan , Ronald E. Wilson , Shashi Shekhar , Betsy George , Ned Levine , Mete Celik, Should SDBMS support a join index?: a case study from CrimeStat, Proceedings of the 16th ACM SIGSPATIAL international conference on Advances in geographic information systems, November 05-07, 2008, Irvine, California
	H. Ledoux , C. M. Gold, Modelling three-dimensional geoscientific fields with the Voronoi diagram and its dual, International Journal of Geographical Information Science, v.22 n.5, p.547-574, January 2008
	Omer Eroglu , H. Ali Mantar , Fatih Erdogan Sevilgen, Quadtree-based approach to data distribution management for distributed simulations, Proceedings of the 2008 Spring simulation multiconference, April 14-17, 2008, Ottawa, Canada
	Thomas W. Sederberg , G. Thomas Finnigan , Xin Li , Hongwei Lin , Heather Ipson, Watertight trimmed NURBS, ACM Transactions on Graphics (TOG), v.27 n.3, August 2008
	Lifeng He , Yuyan Chao , Kenji Suzuki , Kesheng Wu, Fast connected-component labeling, Pattern Recognition, v.42 n.9, p.1977-1987, September, 2009
	Athanasios S. Voulodimos , Charalampos Z. Patrikakis, Combining internet collected data to build personalised location based services, International Journal of Autonomous and Adaptive Communications Systems, v.2 n.2, p.164-174, April 2009
	Despina Kontos , Vasileios Megalooikonomou , James C. Gee, Morphometric analysis of brain images with reduced number of statistical tests: A study on the gender-related differentiation of the corpus callosum, Arificial Intelligence in Medicine, v.47 n.1, p.75-86, September, 2009
	Nan Chen , Li-Dan Shou , Gang Chen , Jin-Xiang Dong, Adaptive indexing of moving objects with highly variable update frequencies, Journal of Computer Science and Technology, v.23 n.6, p.998-1014, November 2008
	Rance D. Necaise , Richard H. Prosl, The color cut quantization algorithm, Proceedings of the 47th Annual Southeast Regional Conference, March 19-21, 2009, Clemson, South Carolina
	James Geller, The teachable letter recognizer, Proceedings of the 9th international joint conference on Artificial intelligence, p.249-251, August 18-23, 1985, Los Angeles, California
	David Chiu , Gagan Agrawal, Hierarchical Caches for Grid Workflows, Proceedings of the 2009 9th IEEE/ACM International Symposium on Cluster Computing and the Grid, p.228-235, May 18-21, 2009
	Baihua Zheng , Wang-Chien Lee , Ken C. Lee , Dik Lun Lee , Min Shao, A distributed spatial index for error-prone wireless data broadcast, The VLDB Journal — The International Journal on Very Large Data Bases, v.18 n.4, p.959-986, August 2009
	P. Punitha , D. S. Guru, Symbolic image indexing and retrieval by spatial similarity: An approach based on B-tree, Pattern Recognition, v.41 n.6, p.2068-2085, June, 2008

INDEX TERMS

Primary Classification:
E. Data

Additional Classification:
I. Computing Methodologies
I.3 COMPUTER GRAPHICS
I.3.6 Methodology and Techniques
Subjects: Graphics data structures and data types

General Terms:
Design, Theory

Collaborative Colleagues:

Hanan Samet: colleagues

Adobe Acrobat

QuickTime

Windows Media Player

Real Player