public void markNeighbor( DelaunayTriangle t )
    {
        if( t.contains( points[1], points[2] ) )
        {
            neighbors[0] = t;
            t.markNeighbor( points[1], points[2], this );
        }
        else if( t.contains( points[0], points[2] ) )
        {
            neighbors[1] = t;
            t.markNeighbor( points[0], points[2], this );
        }
        else if( t.contains( points[0], points[1] ) )
        {
            neighbors[2] = t;
            t.markNeighbor( points[0], points[1], this );
        }
        else
        {
            logger.error( "markNeighbor failed" );
        }
    }
public void markNeighbor ( DelaunayTriangle t ) { if ( t . contains ( points [ 1 ] , points [ 2 ] ) ) { neighbors [ 0 ] = t ; t . markNeighbor ( points [ 1 ] , points [ 2 ] , this ) ; } else if ( t . contains ( points [ 0 ] , points [ 2 ] ) ) { neighbors [ 1 ] = t ; t . markNeighbor ( points [ 0 ] , points [ 2 ] , this ) ; } else if ( t . contains ( points [ 0 ] , points [ 1 ] ) ) { neighbors [ 2 ] = t ; t . markNeighbor ( points [ 0 ] , points [ 1 ] , this ) ; } else { logger . error ( "markNeighbor failed" ) ; } }
/* Exhaustive search to update neighbor pointers