This paper proposes an \$O(n log n)\$ time algorithm for the
one-dimensional geometric fitting problem of two corresponding
sets of \$n\$ points which arises in VLSI module placement.