Planar point location using persistent search trees
Communications of the ACM
Optimal point location in a monotone subdivision
SIAM Journal on Computing
The input/output complexity of sorting and related problems
Communications of the ACM
New results on dynamic planar point location
SIAM Journal on Computing
Dynamic point location in general subdivisions
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps
SIAM Journal on Computing
Handbook of discrete and computational geometry
I/O-efficient dynamic point location in monotone planar subdivisions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
Theory and practice of I/O-efficient algorithms for multidimensional batched searching problems
Proceedings of the ninth annual ACM-SIAM symposium on Discrete algorithms
Range searching in a set of line segments
SCG '85 Proceedings of the first annual symposium on Computational geometry
ACM Computing Surveys (CSUR)
External memory algorithms and data structures: dealing with massive data
ACM Computing Surveys (CSUR)
Design of Dynamic Data Structures
Design of Dynamic Data Structures
ESA '95 Proceedings of the Third Annual European Symposium on Algorithms
External memory data structures
Handbook of massive data sets
Planar point location for large data sets: to seek or not to seek
Journal of Experimental Algorithmics (JEA)
Optimal External Memory Interval Management
SIAM Journal on Computing
The Priority R-tree: a practically efficient and worst-case optimal R-tree
SIGMOD '04 Proceedings of the 2004 ACM SIGMOD international conference on Management of data
SCG '05 Proceedings of the twenty-first annual symposium on Computational geometry
An optimal dynamic interval stabbing-max data structure?
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
The priority R-tree: A practically efficient and worst-case optimal R-tree
ACM Transactions on Algorithms (TALG)
External memory planar point location with logarithmic updates
Proceedings of the twenty-fourth annual symposium on Computational geometry
Efficient temporal counting with bounded error
The VLDB Journal — The International Journal on Very Large Data Bases
Algorithms and data structures for external memory
Foundations and Trends® in Theoretical Computer Science
A new approach on indexing mobile objects on the plane
Data & Knowledge Engineering
The complexity of flow on fat terrains and its i/o-efficient computation
Computational Geometry: Theory and Applications
Computational Geometry: Theory and Applications
I/O-efficient point location in a set of rectangles
LATIN'08 Proceedings of the 8th Latin American conference on Theoretical informatics
External-memory algorithms and data structures
Algorithms and theory of computation handbook
FIFO indexes for decomposable problems
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
New results on two-dimensional orthogonal range aggregation in external memory
Proceedings of the thirtieth ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems
I/O-Efficient flow modeling on fat terrains
WADS'07 Proceedings of the 10th international conference on Algorithms and Data Structures
Efficient external memory structures for range-aggregate queries
Computational Geometry: Theory and Applications
| Hi-index | 0.00 |
We present an I/O-efficient dynamic data structure for point location in a general planar subdivision. Our structure uses O(N/B) disk blocks of size B to store a subdivision of size N. Queries can be answered in O(logB2N) I/Os in the worst-case, and insertions and deletions can be performed in O(logB2N) and O(logBN) I/Os amortized, respectively. Part of our data structure is based on an external version of the so-called logarithmic method that allows for efficient dynamization of static external-memory data structures with certain characteristics. Another important part of our structure is an external data structure for vertical ray-shooting among line segments in the plane with endpoints on √B + 1 vertical lines, developed using an external version of dynamic fractional cascading. We believe that these methods could prove helpful in the development of other dynamic external memory data structures.