Counting circular arc intersections


Journal Article

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 ε>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 O(n4/3+ε), for any ε>0.

Full Text

Duke Authors

Cited Authors

  • Agarwal, PK; Pellegrini, M; Sharir, M

Published Date

  • January 1, 1993

Published In

Volume / Issue

  • 22 / 4

Start / End Page

  • 778 - 793

International Standard Serial Number (ISSN)

  • 0097-5397

Digital Object Identifier (DOI)

  • 10.1137/0222050

Citation Source

  • Scopus