Space-efficient dynamic orthogonal point location, segment intersection, and range reporting

@inproceedings{Blelloch2008SpaceefficientDO,
  title={Space-efficient dynamic orthogonal point location, segment intersection, and range reporting},
  author={Guy E. Blelloch},
  booktitle={SODA},
  year={2008}
}
We describe an asymptotically optimal data-structure for dynamic point location for horizontal segments. For n line-segments, queries take O(log n) time, updates take O(log n) amortized time and the data structure uses O(n) space. This is the first structure for the problem that is optimal in space and time (modulo the possibility of removing amortization). We also describe dynamic data structures for orthogonal range reporting and orthogonal intersection reporting. In both data structures for… CONTINUE READING

References

Publications referenced by this paper.
Showing 1-6 of 6 references

Persistence

  • P. F. Dietz, R. Raman
  • amortization and randomization. In Proc. 2nd…
  • 1991
Highly Influential
5 Excerpts

Similar Papers

Loading similar papers…