Build Triangulation even with intersecting constraint edges

Oslandia · Apr 17, 2019 · 2ed2d3d · 2ed2d3d
1 parent 3b8204c
commit 2ed2d3d
Showing 1 changed file with 2 additions and 7 deletions.
diff --git a/src/detail/triangulate/ConstraintDelaunayTriangulation.cpp b/src/detail/triangulate/ConstraintDelaunayTriangulation.cpp
@@ -145,14 +145,9 @@ void ConstraintDelaunayTriangulation::getTriangles( TriangulatedSurface& triangu
 
         const Coordinate& c = it->vertex( 2 )->info().original ;
 
-        // check that vertex has an original vertex
-        if ( a.isEmpty() || b.isEmpty() || c.isEmpty() ) {
-            BOOST_THROW_EXCEPTION( Exception(
-                                       ( boost::format( "Can't convert Triangulation to TriangulatedSurface (constraint intersection found)" ) ).str()
-                                   ) ) ;
+        if ( !a.isEmpty() &&  !b.isEmpty() && !c.isEmpty() ) {
+            triangulatedSurface.addTriangle( new Triangle( Point( a ), Point( b ), Point( c ) ) );
         }
-
-        triangulatedSurface.addTriangle( new Triangle( Point( a ), Point( b ), Point( c ) ) );
     }
 }