Sweeping arrangements of curves
Jack Scott Snoeyink, John E. Hershberger · 1989
We consider arrangements of curves that intersect pairwise in at most k points. We show that a curve can sweep any such arrangement and maintain the k-intersection property if and only if k equals 1 or 2. We apply this result to an eclectic set of problems: finding Boolean formulae for polygons with curved edges, counting triangles and digons in arrangements of pseudocircles, and finding extension curves for arrangements. We also discuss implementing the sweep.