Computational geometry: an introduction
Computational geometry: an introduction
Analysis of object oriented spatial access methods
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Information Processing Letters
Efficient Component Labeling of Images of Arbitrary Dimension Represented by Linear Bintrees
IEEE Transactions on Pattern Analysis and Machine Intelligence
Efficient structures for geometric data management
Efficient structures for geometric data management
Fractals for secondary key retrieval
PODS '89 Proceedings of the eighth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
Applications of spatial data structures: Computer graphics, image processing, and GIS
Applications of spatial data structures: Computer graphics, image processing, and GIS
The design and analysis of spatial data structures
The design and analysis of spatial data structures
Computer graphics: principles and practice (2nd ed.)
Computer graphics: principles and practice (2nd ed.)
The LSD tree: spatial access to multidimensional and non-point objects
VLDB '89 Proceedings of the 15th international conference on Very large data bases
The R*-tree: an efficient and robust access method for points and rectangles
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
A general approach to connected-component labeling for arbitrary image representations
Journal of the ACM (JACM)
Computational strategies for object recognition
ACM Computing Surveys (CSUR)
A qualitative comparison study of data structures for large line segment databases
SIGMOD '92 Proceedings of the 1992 ACM SIGMOD international conference on Management of data
Model-based object recognition in dense-range images—a review
ACM Computing Surveys (CSUR)
CIKM '93 Proceedings of the second international conference on Information and knowledge management
Spatial data models and query processing
Modern database systems
Modern database systems
Hashing by proximity to process duplicates in spatial databases
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Multi-step processing of spatial joins
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Spatial joins using seeded trees
SIGMOD '94 Proceedings of the 1994 ACM SIGMOD international conference on Management of data
Separability of polyhedra for optimal filtering of spatial and constraint data
PODS '95 Proceedings of the fourteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
A general solution of the n-dimensional B-tree problem
SIGMOD '95 Proceedings of the 1995 ACM SIGMOD international conference on Management of data
Approximating polyhedra with spheres for time-critical collision detection
ACM Transactions on Graphics (TOG)
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
OBBTree: a hierarchical structure for rapid interference detection
SIGGRAPH '96 Proceedings of the 23rd annual conference on Computer graphics and interactive techniques
An overview of data warehousing and OLAP technology
ACM SIGMOD Record
Cubetree: organization of and bulk incremental updates on the data cube
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The SR-tree: an index structure for high-dimensional nearest neighbor queries
SIGMOD '97 Proceedings of the 1997 ACM SIGMOD international conference on Management of data
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
The art of computer programming, volume 1 (3rd ed.): fundamental algorithms
Computational geometry: algorithms and applications
Computational geometry: algorithms and applications
Space-filling curves and their use in the design of geometric data structures
Theoretical Computer Science - Special issue: Latin American theoretical informatics
The art of computer programming, volume 3: (2nd ed.) sorting and searching
The art of computer programming, volume 3: (2nd ed.) sorting and searching
Bulk-insertions into R-trees using the small-tree-large-tree approach
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
A greedy algorithm for bulk loading R-trees
Proceedings of the 6th ACM international symposium on Advances in geographic information systems
Efficient processing of window queries in the pyramid data structure
PODS '90 Proceedings of the ninth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems
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
Post-optimization and incremental refinement of R-trees
Proceedings of the 7th ACM international symposium on Advances in geographic information systems
Sequential Operations in Digital Picture Processing
Journal of the ACM (JACM)
Pyramid computer algorithms for determining geometric properties of images
SCG '85 Proceedings of the first annual symposium on Computational geometry
An Algorithm for Finding Best Matches in Logarithmic Expected Time
ACM Transactions on Mathematical Software (TOMS)
Computer Processing of Line-Drawing Images
ACM Computing Surveys (CSUR)
Communications of the ACM
Strip trees: a hierarchical representation for curves
Communications of the ACM
An effective way to represent quadtrees
Communications of the ACM
Preserving average proximity in arrays
Communications of the ACM
Multidimensional binary search trees used for associative searching
Communications of the ACM
ACM Computing Surveys (CSUR)
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
A class of data structures for associative searching
PODS '84 Proceedings of the 3rd ACM SIGACT-SIGMOD symposium on Principles of database systems
R-trees: a dynamic index structure for spatial searching
SIGMOD '84 Proceedings of the 1984 ACM SIGMOD international conference on Management of data
SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees
Journal of Intelligent Information Systems
Collision Detection for Interactive Graphics Applications
IEEE Transactions on Visualization and Computer Graphics
Efficient Collision Detection Using Bounding Volume Hierarchies of k-DOPs
IEEE Transactions on Visualization and Computer Graphics
Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
Efficient Cost Models for Spatial Queries Using R-Trees
IEEE Transactions on Knowledge and Data Engineering
STR: A Simple and Efficient Algorithm for R-Tree Packing
ICDE '97 Proceedings of the Thirteenth International Conference on Data Engineering
An Implementation and Performance Analysis of Spatial Data Access Methods
Proceedings of the Fifth International Conference on Data Engineering
Spatial Database Indices for Large Extended Objects
Proceedings of the Seventh International Conference on Data Engineering
Similarity Indexing with the SS-tree
ICDE '96 Proceedings of the Twelfth International Conference on Data Engineering
The LSDh-Tree: An Access Structure for Feature Vectors
ICDE '98 Proceedings of the Fourteenth International Conference on Data Engineering
Optimization Issues in R-tree Construction (Extended Abstract)
IGIS '94 Proceedings of the International Workshop on Advanced Information Systems: Geographic Information Systems
A Generic Approach to Bulk Loading Multidimensional Index Structures
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
On Optimal Node Splitting for R-trees
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
Scalable Sweeping-Based Spatial Join
VLDB '98 Proceedings of the 24rd International Conference on Very Large Data Bases
The R+-Tree: A Dynamic Index for Multi-Dimensional Objects
VLDB '87 Proceedings of the 13th International Conference on Very Large Data Bases
The A-tree: An Index Structure for High-Dimensional Spaces Using Relative Approximation
VLDB '00 Proceedings of the 26th International Conference on Very Large Data Bases
XXL - A Library Approach to Supporting Efficient Implementations of Advanced Database Queries
Proceedings of the 27th International Conference on Very Large Data Bases
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Hilbert R-tree: An Improved R-tree using Fractals
VLDB '94 Proceedings of the 20th International Conference on Very Large Data Bases
Benchmarking Spatial Join Operations with Spatial Output
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
Generalized Search Trees for Database Systems
VLDB '95 Proceedings of the 21th International Conference on Very Large Data Bases
The X-tree: An Index Structure for High-Dimensional Data
VLDB '96 Proceedings of the 22th International Conference on Very Large Data Bases
Enclosing Many Boxes by an Optimal Pair of Boxes
STACS '92 Proceedings of the 9th Annual Symposium on Theoretical Aspects of Computer Science
The Performance of Object Decomposition Techniques for Spatial Query Processing
SSD '91 Proceedings of the Second International Symposium on Advances in Spatial Databases
Query Processing of Spatial Objects: Complexity versus Redundancy
SSD '93 Proceedings of the Third International Symposium on Advances in Spatial Databases
Optimal Redundancy in Spatial Database Systems
SSD '95 Proceedings of the 4th International Symposium on Advances in Spatial Databases
The S-Tree: An Efficient Index for Multidimensional Objects
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
New Linear Node Splitting Algorithm for R-trees
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
Orthogonal Polygons as Bounding Structures in Filter-Refine Query Processing Strategies
SSD '97 Proceedings of the 5th International Symposium on Advances in Spatial Databases
GBI: A Generalized R-Tree Bulk-Insertion Strategy
SSD '99 Proceedings of the 6th International Symposium on Advances in Spatial Databases
Visualizing and Animating R-trees and Spatial Operations in Spatial Databases on the Worldwide Web
VDB4 Proceedings of the IFIP TC2/WG 2.6 Fourth Working Conference on Visual Database Systems 4
The TR*-Tree: A New Representation of Polygonal Objects Supporting Spatial Queries and Operations
CG '91 Proceedings of the International Workshop on Computational Geometry - Methods, Algorithms and Applications
Proceedings of the Sixth International Conference on Data Engineering
STING: A Statistical Information Grid Approach to Spatial Data Mining
VLDB '97 Proceedings of the 23rd International Conference on Very Large Data Bases
VASCO: visualizing and animating spatial constructs and operations
Proceedings of the nineteenth annual symposium on Computational geometry
On visible surface generation by a priori tree structures
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
Primitives for the manipulation of general subdivisions and the computation of Voronoi diagrams
STOC '83 Proceedings of the fifteenth annual ACM symposium on Theory of computing
The Hybrid Tree: An Index Structure for High Dimensional Feature Spaces
ICDE '99 Proceedings of the 15th International Conference on Data Engineering
Data Redundancy and Duplicate Detection in Spatial Join Processing
ICDE '00 Proceedings of the 16th International Conference on Data Engineering
SSDBM '01 Proceedings of the 13th International Conference on Scientific and Statistical Database Management
Efficient computation and data structures for graphics.
Efficient computation and data structures for graphics.
Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing
ACM Transactions on Database Systems (TODS)
Foundations of Multidimensional and Metric Data Structures (The Morgan Kaufmann Series in Computer Graphics and Geometric Modeling)
All-nearest-neighbors finding based on the Hilbert curve
Expert Systems with Applications: An International Journal
Hi-index | 0.00 |
An overview is presented of object-based and image-based representations of objects by their interiors. The representations are distinguished by the manner in which they can be used to answer two fundamental queries in database applications: (1) Feature query: given an object, determine its constituent cells (i.e., their locations in space). (2) Location query: given a cell (i.e., a location in space), determine the identity of the object (or objects) of which it is a member as well as the remaining constituent cells of the object (or objects). Regardless of the representation that is used, the generation of responses to the feature and location queries is facilitated by building an index (i.e., the result of a sort) either on the objects or on their locations in space, and implementing it using an access structure that correlates the objects with the locations. Assuming the presence of an access structure, implicit (i.e., image-based) representations are described that are good for finding the objects associated with a particular location or cell (i.e., the location query), while requiring that all cells be examined when determining the locations associated with a particular object (i.e., the feature query). In contrast, explicit (i.e., object-based) representations are good for the feature query, while requiring that all objects be examined when trying to respond to the location query. The goal is to be able to answer both types of queries with one representation and without possibly having to examine every cell. Representations are presented that achieve this goal by imposing containment hierarchies on either space (i.e., the cells in the space in which the objects are found), or objects. In the former case, space is aggregated into successively larger-sized chunks (i.e., blocks), while in the latter, objects are aggregated into successively larger groups (in terms of the number of objects that they contain). The former is applicable to image-based interior-based representations of which the space pyramid is an example. The latter is applicable to object-based interior-based representations of which the R-tree is an example. The actual mechanics of many of these representations are demonstrated in the VASCO JAVA applets found at http://www.cs.umd.edu/˜hjs/quadtree/index.html.