Object representation by means of nonminimal division quadtrees and octrees
ACM Transactions on Graphics (TOG)
Storing a collection of polygons using quadtrees
ACM Transactions on Graphics (TOG)
ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
An effective way to represent quadtrees
Communications of the ACM
A survey of techniques for fixed radius near neighbor searching.
A survey of techniques for fixed radius near neighbor searching.
A population analysis for hierarchical data structures
SIGMOD '87 Proceedings of the 1987 ACM SIGMOD international conference on Management of data
Hierarchical Data Structures and Algorithms for Computer Graphics. Part I.
IEEE Computer Graphics and Applications
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
Hashing by proximity to process duplicates in spatial databases
CIKM '94 Proceedings of the third international conference on Information and knowledge management
Partition based spatial-merge join
SIGMOD '96 Proceedings of the 1996 ACM SIGMOD international conference on Management of data
MARCO: MAp Retrieval by COntent
IEEE Transactions on Pattern Analysis and Machine Intelligence
Distance browsing in spatial databases
ACM Transactions on Database Systems (TODS)
Using space-time grid for efficient management of moving objects
Proceedings of the 2nd ACM international workshop on Data engineering for wireless and mobile access
SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees
Journal of Intelligent Information Systems
Dynamic Vector and Raster Integrated Data Model Based on Code-Points
ICCS '02 Proceedings of the International Conference on Computational Science-Part III
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
Performance of Data-Parallel Spatial Operations
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
Storage and Retrieval of Moving Objects
MDM '01 Proceedings of the Second International Conference on Mobile Data Management
The VLDB Journal — The International Journal on Very Large Data Bases
Database support for multiresolution terrain visualization
ADC '03 Proceedings of the 14th Australasian database conference - Volume 17
Range and kNN query processing for moving objects in grid model
Mobile Networks and Applications
Parallel Computing - Special issue: High performance computing with geographical data
Bulk Operations for Space-Partitioning Trees
ICDE '04 Proceedings of the 20th International Conference on Data Engineering
Decoupling partitioning and grouping: Overcoming shortcomings of spatial indexing with bucketing
ACM Transactions on Database Systems (TODS)
Efficient query processing on spatial networks
Proceedings of the 13th annual ACM international workshop on Geographic information systems
Remote thin-client access to spatial database systems
dg.o '02 Proceedings of the 2002 annual national conference on Digital government research
On past-time indexing of moving objects
Journal of Systems and Software
STEWARD: architecture of a spatio-textual search engine
Proceedings of the 15th annual ACM international symposium on Advances in geographic information systems
Multidimensional data structures for spatial applications
Algorithms and theory of computation handbook
APR-Quad: an update efficient authenticated dictionary for spatial data
Proceedings of the 4th ACM SIGSPATIAL International Workshop on Security and Privacy in GIS and LBS
GD'05 Proceedings of the 13th international conference on Graph Drawing
| Hi-index | 0.00 |
A consistent hierarchical data structure for the representation of vector data is presented. It makes use of a concept termed a line segment fragment to prevent data degradation under splitting or clipping of vector primitives. This means that the insertion and subsequent deletion (and vice versa) of a vector leaves the data unchanged. Vectors are represented exactly and not as digital approximations. The data is dynamically organized by use of simple probabilistic splitting and merging rules. The use of the structure for implementing a geographic information system is described. Algorithms for constructing and manipulating the structure are provided. Results of empirical tests comparing the structure to other representations in the literature are given.