Version 5.0 The LEDA User Manual

void SWEEP SEGMENTS(const list& L,
GRAPH & G,
bool embed = true)
takes as input a list L of r circle segments and computes
the planar graph G induced by the segments in
L. The nodes of G are all endpoints and all proper
intersection points of segments in L. The edges of G
are the maximal relatively open subsegments of segments
in L that contain no node of G. The edges
are directed as the corresponding segments, if embed
is false. Otherwise, the corresponding planar map is
computed. Note that for each edge e G[e] is the input
segment containing e.
The algorithm (a variant of [11]) runs in time O((n +
s) log n) + m), where n is the number of segments, s
is the number of vertices of the graph G, and m is the
number of edges of G. If L contains no overlapping
segments then m = O(n + s).