he problem is singular.  In particular, the position of one
      city is completely arbitrary, and one component of a second city is
      completely arbitrary (and a third city's position can be "flipped"
      about the line connecting cities one and two).  To remove some of this
      singularity, the program assigns city #1 the position (0,0) and city #2
      is given a zero Y coordinate.  
    </p>

    <p>
      In N-dimensional space, a similar set of constraints must be placed
      on the first N