An Elementary Algorithm for ReportingIntersections of Red / Blue Curve Segments

  • Jean-Daniel Boissonnaty, Antoine Vigneronz
  • Published 2002


Let Er and Eb be two sets of x-monotone and non-intersecting curve segments, E = Er [ Eb and jEj = n. We give a new sweep-line algorithm that reports the k intersecting pairs of segments of E. Our algorithm uses only three simple predicates that allow to decide if two segments intersect, if a point is left or right to another point, and if a point is above… (More)


Figures and Tables

Sorry, we couldn't extract any figures or tables for this paper.

Slides referencing similar topics