Highly Influenced

- Published 1987 in J. Algorithms
DOI:10.1016/0196-6774(87)90024-1

We consider two restricted types of dynamic orthogonal segment intersection search problems. One is the problem in which the underlying set is updated only by insertions. In the other, the set is updated only by deletions. We show that an intermixed sequence of O(n) queries and updates in both problems can be executed on-line in O( n log n + K) time and 0âŚÂ CONTINUE READING

### Presentations referencing similar topics