Range searching in a set of line segments

@inproceedings{Overmars1985RangeSI,
  title={Range searching in a set of line segments},
  author={Mark H. Overmars},
  booktitle={Symposium on Computational Geometry},
  year={1985}
}
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… CONTINUE READING

From This Paper

Topics from this paper.