code: public DelaunayTriangle neighborCW( TriangulationPoint point )
      {
          if( point == points[0] )
          {
              return neighbors[1];
          }
          else if( point == points[1] )
          {
              return neighbors[2];
          }
          return neighbors[0];
      }
docs: The neighbor clockwise to given point