Counting Circular Arc Intersections (2002)
by
Pankaj K. Agarwal
,
Marco Pellegrini
,
Micha Sharir
| Citations: | 10 - 2 self |
BibTeX
@MISC{Agarwal02countingcircular,
author = {Pankaj K. Agarwal and Marco Pellegrini and Micha Sharir},
title = {Counting Circular Arc Intersections},
year = {2002}
}
Years of Citing Articles
Bookmark
 |
 |
 |
 |
 |
 |
OpenURL
Abstract
In this paper we present efficient algorithms for counting intersections in a collection of circles or circular arcs. We present an algorithm to count intersections in a collection of n circles whose running time is O(n ), for any > 0. Using this algorithm as a subroutine, we show that the intersections in a set of n circular arcs can also be counted in time O(n ). If all arcs have the same radius, the running time can be improved to O(n ), for any > 0.
