 cities, or the least squares solver is likely to fail.
      (That is, we specify all N components of the first city to be 0, 
      N-1 components of the second one, and so on, up to the N-th city
      which has a single zero component).
    </p>

    <p>
      The computations carried out by this program assume that the cities
      lie on a plane.  If the distance data is for international cities,
      the effect of spherical geometry may make the planar approximation
      very bad.
    </p>

    <p>