An \$O( n sup 2 )\$-time optimal algorithm is given for the problem of
constructing the visibility graph of disjoint polygons with \$n\$
edges.