Loading...
Please wait, while we are loading the content...
Similar Documents
Counting circular arc intersections (1993).
| Content Provider | CiteSeerX |
|---|---|
| Author | Agarwal, Pankaj K. Pellegrini, Marco Sharir, Micha |
| Abstract | In this paper efficient algorithms for counting intersections in a collection of circles or circular arcs are presented. An algorithm for counting intersections in a collection of n circles is presented whose running time is O (n3/2+), for any e> 0 is presented. Using this algorithm as a subroutine, it is shown that the intersections in a set of n circular arcs can also be counted in time O(n3/2+). If all arcs have the same radius, the running time can be improved to 0(n4/3+), for any e > 0. |
| File Format | |
| Publisher Date | 1993-01-01 |
| Access Restriction | Open |
| Content Type | Text |
| Resource Type | Article |
