We show that reconstructing a set of n orthogonal line segments in the
plane from the set of their vertices can be done in O(n log n) time,
if the segments are allowed to cross. If the segments are not allowed
to cross, the problem becomes NP-complete.