Design of Dynamic Data Structures
Design of Dynamic Data Structures
Computation of the axial view of a set of isothetic parallelepipeds
ACM Transactions on Graphics (TOG)
Dynamic trees and dynamic point location
STOC '91 Proceedings of the twenty-third annual ACM symposium on Theory of computing
Dynamization of the trapezoid method for planar point location (extended abstract)
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
Dynamic point location in general subdivisions
SODA '92 Proceedings of the third annual ACM-SIAM symposium on Discrete algorithms
A unified approach to dynamic point location, ray shooting, and shortest paths in planar maps
SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
I/O-efficient dynamic point location in monotone planar subdivisions
Proceedings of the tenth annual ACM-SIAM symposium on Discrete algorithms
I/O-efficient dynamic planar point location (extended abstract)
Proceedings of the sixteenth annual symposium on Computational geometry
External memory data structures
Handbook of massive data sets
I/O-efficient dynamic planar point location
Computational Geometry: Theory and Applications
External memory planar point location with logarithmic updates
Proceedings of the twenty-fourth annual symposium on Computational geometry
| Hi-index | 0.00 |
The range searching (or windowing) problem asks for an accommodation of a set of objects such that those objects that lie (partially) in a given axis-parallel rectangle can be reported efficiently. We solve the range searching problem for a set of n non-intersecting, but possibly touching, line segments in the plane and give a data structure that allows for range queries in &Ogr;(k+ log2 n) time, where k is the number of reported answers. The structure is dynamic and allows for insertions and deletions of line segments in &Ogr;(log2 n) time. The structure uses &Ogr;(n log n) storage. The related problem of moving the window (range) parallel to one of the coordinate-axes, determining the first line segment that will become visible or stops being visible, is treated as well and similar bounds are obtained.