Optimal point location in a monotone subdivision
SIAM Journal on Computing
ACM Computing Surveys (CSUR)
The Quadtree and Related Hierarchical Data Structures
ACM Computing Surveys (CSUR)
Plane-sweep algorithms for intersecting geometric figures
Communications of the ACM
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
Key-Problems and Key-Methods in Computational Geormetry
STACS '84 Proceedings of the Symposium of Theoretical Aspects of Computer Science
Fast Triangulation of Simple Polygons
Proceedings of the 1983 International FCT-Conference on Fundamentals of Computation Theory
Efficient computation and data structures for graphics.
Efficient computation and data structures for graphics.
Analysis of quadtree algorithms (graphics)
Analysis of quadtree algorithms (graphics)
A consistent hierarchical representation for vector data
SIGGRAPH '86 Proceedings of the 13th annual conference on Computer graphics and interactive techniques
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
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
Multidimensional access methods
ACM Computing Surveys (CSUR)
Separability of Polyhedra for Optimal Filtering of Spatial and Constraint Data
Journal of Automated Reasoning
SP-GiST: An Extensible Database Index for Supporting Space Partitioning Trees
Journal of Intelligent Information Systems
Tree-Based Access Methods for Spatial Databases: Implementation and Performance Evaluation
IEEE Transactions on Knowledge and Data Engineering
VLDB '90 Proceedings of the 16th International Conference on Very Large Data Bases
An Access Method for Integrating Multi-scale Geometric Data
ADBIS '02 Proceedings of the 6th East European Conference on Advances in Databases and Information Systems
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
ACM-SE 45 Proceedings of the 45th annual southeast regional conference
Scalable network distance browsing in spatial databases
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
Spatial indexing in microsoft SQL server 2008
Proceedings of the 2008 ACM SIGMOD international conference on Management of data
A sorting approach to indexing spatial data
ACM SIGGRAPH 2008 classes
Spatial indexing on tetrahedral meshes
Proceedings of the 18th SIGSPATIAL International Conference on Advances in Geographic Information Systems
Multidimensional data structures for spatial applications
Algorithms and theory of computation handbook
ACM SIGGRAPH ASIA 2010 Courses
Remote sensing image information mining with HPC cluster and DryadLINQ
Proceedings of the 49th Annual Southeast Regional Conference
The PR-star octree: a spatio-topological data structure for tetrahedral meshes
Proceedings of the 19th ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems
X-device query processing by bitwise distribution
DaMoN '12 Proceedings of the Eighth International Workshop on Data Management on New Hardware
PL-Tree: an efficient indexing method for high-dimensional data
SSTD'13 Proceedings of the 13th international conference on Advances in Spatial and Temporal Databases
Proceedings of the Second ACM SIGSPATIAL International Workshop on Mobile Geographic Information Systems
| Hi-index | 0.00 |
An adaptation of the quadtree data structure that represents polygonal maps (i.e., collections of polygons, possibly containing holes) is described ina manner that is also useful for the manipulation of arbitrary collections of straight line segments. The gol is to store these maps without the loss of information that results from digitization, and to obtain a worst-case execution time that is not overly sensitive to the positioning of the map. A regular decomposition variant of the region quadtree is used to organize the vertices and edges of the maps. A number of related data organizations are proposed in an iterative manner until a method is obtained that meets the stated goals. The result is termed a PM (polygonal map) quadtree and is based on a regular decomposition point space quadtree (PR quadtree) that stores additional information about the edges at its terminal nodes. Algorithms are given for inserting and deleting line segments from a PM quadtree. Use of the PM quadtree to perform point location, dynamic line insertion, and map overlay is discussed. The PM quadtree is compared conceptually to the K-structure and the layered dag with respect to typical cartographic data. An empirical comparison of the PM quadtree with other quadtree-based representations for polygonal maps is also provided.