Computational geometry: an introduction
Computational geometry: an introduction
Planar point location using persistent search trees
Communications of the ACM
Optimal point location in a monotone subdivision
SIAM Journal on Computing
Analysis of object oriented spatial access methods
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The Grid File: An Adaptable, Symmetric Multikey File Structure
ACM Transactions on Database Systems (TODS)
Direct spatial search on pictorial databases using packed R-trees
SIGMOD '85 Proceedings of the 1985 ACM SIGMOD international conference on Management of data
ACM Computing Surveys (CSUR)
Representations for Rigid Solids: Theory, Methods, and Systems
ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Multidimensional binary search trees used for associative searching
Communications of the ACM
Communications of the ACM
Principles of Database Systems
Principles of Database Systems
Digital Picture Processing
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
The K-D-B-tree: a search structure for large multidimensional dynamic indexes
SIGMOD '81 Proceedings of the 1981 ACM SIGMOD international conference on Management of data
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
The quad-CIF tree: A data structure for hierarchical on-line algorithms
DAC '82 Proceedings of the 19th Design Automation Conference
Efficient computation and data structures for graphics.
Efficient computation and data structures for graphics.
Application of alternative quadtree representations (vlsi, data structures)
Application of alternative quadtree representations (vlsi, data structures)
Efficient structures for geometric data management
Efficient structures for geometric data management
A predicate matching algorithm for database rule systems
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Linear clustering of objects with multiple attributes
SIGMOD '90 Proceedings of the 1990 ACM SIGMOD international conference on Management of data
Constraint-based query optimization for spatial databases
PODS '91 Proceedings of the tenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Complex Gaussian integers for “Gaussian graphics”
ACM SIGPLAN Notices
Window real objects: a distributed shared memory for distributed implementation of GUI applications
UIST '93 Proceedings of the 6th annual ACM symposium on User interface software and technology
Multidimensional access methods
ACM Computing Surveys (CSUR)
R-tree implementation using branch-grafting method
SAC '00 Proceedings of the 2000 ACM symposium on Applied computing - Volume 1
Video Coding for Mobile Handheld Conferencing
Multimedia Tools and Applications
On the Data Model and Access Method of Summary Data Management
IEEE Transactions on Knowledge and Data Engineering
Efficient Management of Time-Evolving Databases
IEEE Transactions on Knowledge and Data Engineering
Extending Rectangle Join Algorithms for Rectilinear Polygons
WAIM '00 Proceedings of the First International Conference on Web-Age Information Management
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Efficient shape retrieval by parts
CAIP '99 Proceedings of the 8th International Conference on Computer Analysis of Images and Patterns
On using B+-tree for efficient processing for the boundary neighborhood problem
WSEAS TRANSACTIONS on SYSTEMS
Workload-aware data partitioning in community-driven data grids
Proceedings of the 12th International Conference on Extending Database Technology: Advances in Database Technology
Rapid retrieval algorithms for case-based reasoning
IJCAI'89 Proceedings of the 11th international joint conference on Artificial intelligence - Volume 1
Sequenced spatiotemporal aggregation for coarse query granularities
The VLDB Journal — The International Journal on Very Large Data Bases
A behavior-based personal controller for autonomous ubiquitous computing
UCS'04 Proceedings of the Second international conference on Ubiquitous Computing Systems
Evaluation of a dynamic tree structure for indexing query regions on streaming geospatial data
SSTD'05 Proceedings of the 9th international conference on Advances in Spatial and Temporal Databases
Hi-index | 0.00 |
A tutorial survey is presented of hierarchical data structures for representing collections of small rectangles. Rectangles are often used as an approximation of shapes for which they serve as the minimum rectilinear enclosing object. They arise in applications in cartography as well as very large-scale integration (VLSI) design rule checking. The different data structures are discussed in terms of how they support the execution of queries involving proximity relations. The focus is on intersection and subset queries. Several types of representations are described. Some are designed for use with the plane-sweep paradigm, which works well for static collections of rectangles. Others are oriented toward dynamic collections. In this case, one representation reduces each rectangle to a point in a higher multidimensional space and treats the problem as one involving point data. The other representation is area based—that is, it depends on the physical extent of each rectangle.