A worst-case optimal algorithm is presented for computing the
visibility graph of line segments. This yields an \$O(n sup 2 )\$-time
algorithm for computing the Euclidean shortest paths between two
points among polygonal obstacles with \$n\$ total edges.