3535import org .poly2tri .triangulation .TriangulationPoint ;
3636import org .poly2tri .triangulation .delaunay .sweep .DTSweepConstraint ;
3737import org .poly2tri .triangulation .point .TPoint ;
38- import org .slf4j .Logger ;
39- import org .slf4j .LoggerFactory ;
4038
4139
4240public class DelaunayTriangle
4341{
44- private final static Logger logger = LoggerFactory .getLogger ( DelaunayTriangle .class );
4542
4643 /** Neighbor pointers */
4744 public final DelaunayTriangle [] neighbors = new DelaunayTriangle [3 ];
@@ -134,7 +131,7 @@ else if( ( p1 == points[0] && p2 == points[1] ) || ( p1 == points[1] && p2 == po
134131 }
135132 else
136133 {
137- logger . error ( "Neighbor error, please report!" );
134+ System . err . println ( "Neighbor error, please report!" );
138135 // throw new Exception("Neighbor error, please report!");
139136 }
140137 }
@@ -159,7 +156,7 @@ else if( t.contains( points[0], points[1] ) )
159156 }
160157 else
161158 {
162- logger . error ( "markNeighbor failed" );
159+ System . err . println ( "markNeighbor failed" );
163160 }
164161 }
165162
@@ -269,7 +266,7 @@ else if( point == points[2] )
269266 {
270267 return points [0 ];
271268 }
272- logger . error ( "point location error" );
269+ System . err . println ( "point location error" );
273270 throw new RuntimeException ("[FIXME] point location error" );
274271 }
275272
@@ -288,7 +285,7 @@ else if( point == points[2] )
288285 {
289286 return points [1 ];
290287 }
291- logger . error ( "point location error" );
288+ System . err . println ( "point location error" );
292289 throw new RuntimeException ("[FIXME] point location error" );
293290 }
294291
@@ -315,7 +312,7 @@ else if( oPoint == points[2] )
315312 }
316313 else
317314 {
318- logger . error ( "legalization error" );
315+ System . err . println ( "legalization error" );
319316 throw new RuntimeException ("legalization bug" );
320317 }
321318 }
0 commit comments