Counting circular arc intersections
SCG '91 Proceedings of the seventh annual symposium on Computational geometry
| Hi-index | 0.00 |
\indent In this paper we present efficient algorithms for counting intersections in a collection of circles or circular arcs. We present a randomized algorithm to count intersections in a collection of $n$ circles whose expected running time is $O(n^{3/2+\epsilon})$, for any $\epsilon