Searching edges in the overlap of two plane graphs

John Iacono, Elena Khramtcova, Stefan Langerman

Consider a pair of plane straight-line graphs, whose edges are colored red and blue, respectively, and let n be the total complexity of both graphs. We present a O(n log n)-time O(…