Two algorithms for maintaining order in a list
STOC '87 Proceedings of the nineteenth annual ACM symposium on Theory of computing
Dynamic planar point location with optimal query time
IDTC Second international conference on Database theory
Persistence, amortization and randomization
SODA '91 Proceedings of the second annual ACM-SIAM symposium on Discrete algorithms
New results on dynamic planar point location
SIAM Journal on Computing
Eliminating amortization: on data structures with guaranteed response time
Eliminating amortization: on data structures with guaranteed response time
Trans-dichotomous algorithms for minimum spanning trees and shortest paths
Journal of Computer and System Sciences - Special issue: 31st IEEE conference on foundations of computer science, Oct. 22–24, 1990
Dynamic point location in general subdivisions
SODA selected papers from the third annual ACM-SIAM symposium on Discrete algorithms
ACM SIGACT News
A Unified Approach to Dynamic Point Location, Ray Shooting, and Shortest Paths in Planar Maps
SIAM Journal on Computing
Dynamic Trees and Dynamic Point Location
SIAM Journal on Computing
Design of Dynamic Data Structures
Design of Dynamic Data Structures
The Design and Analysis of Computer Algorithms
The Design and Analysis of Computer Algorithms
SODA '03 Proceedings of the fourteenth annual ACM-SIAM symposium on Discrete algorithms
Dynamic rectangular intersection with priorities
Proceedings of the thirty-fifth annual ACM symposium on Theory of computing
Optimal External Memory Interval Management
SIAM Journal on Computing
SODA '04 Proceedings of the fifteenth annual ACM-SIAM symposium on Discrete algorithms
Three-Dimensional Layers of Maxima
Algorithmica
An optimal dynamic interval stabbing-max data structure?
SODA '05 Proceedings of the sixteenth annual ACM-SIAM symposium on Discrete algorithms
Improved Dynamic Planar Point Location
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Planar Point Location in Sublogarithmic Time
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
FOCS '06 Proceedings of the 47th Annual IEEE Symposium on Foundations of Computer Science
Optimal dynamic vertical ray shooting in rectilinear planar subdivisions
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Space-efficient dynamic orthogonal point location, segment intersection, and range reporting
Proceedings of the nineteenth annual ACM-SIAM symposium on Discrete algorithms
Transdichotomous Results in Computational Geometry, I: Point Location in Sublogarithmic Time
SIAM Journal on Computing
Cloning Voronoi diagrams via retroactive data structures
ESA'10 Proceedings of the 18th annual European conference on Algorithms: Part I
A fast algorithm for three-dimensional layers of maxima problem
WADS'11 Proceedings of the 12th international conference on Algorithms and data structures
Fully retroactive approximate range and nearest neighbor searching
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Full-Fledged real-time indexing for constant size alphabets
ICALP'13 Proceedings of the 40th international conference on Automata, Languages, and Programming - Volume Part I
Dynamic planar point location with sub-logarithmic local updates
WADS'13 Proceedings of the 13th international conference on Algorithms and Data Structures
Efficient range searching for categorical and plain data
ACM Transactions on Database Systems (TODS)
| Hi-index | 0.00 |
We consider the dynamic vertical ray shooting problem against horizontal disjoint segments, that is, the task of maintaining a dynamic set S of n nonintersecting horizontal line segments in the plane under a query that reports the first segment in S intersecting a vertical ray from a query point. We develop a linear-size structure that supports queries, insertions, and deletion in O(log n) worst-case time. Our structure works in the comparison model on a random access machine.