Fix numerically negative areas leading to infinite loop in dynamic programming.

Jérémie Dumas · jdumas · commit 4563bbf6b285 · 2026-04-13T10:57:45.000-07:00
diff --git a/include/Src/ConstrainedTriangulation.h b/include/Src/ConstrainedTriangulation.h
@@ -42,7 +42,7 @@ namespace MishaK
 					Point< GeometryReal , 2 > d[] = { vertices[i1]-vertices[i0] , vertices[i2]-vertices[i0] };
 					SquareMatrix< double , 2 > M;
 					for( int i=0 ; i<2 ; i++ ) for( int j=0 ; j<2 ; j++ ) M(i,j) = Point< GeometryReal , 2 >::Dot( d[i] , d[j] );
-					return M.determinant();
+					return std::max< double >( 0. , M.determinant() );
 				};
 			MinimalAreaTriangulation::GetTriangulation( SquaredArea , static_cast< unsigned int >( vertices.size() ) , outputTriangles );
 		}

Original file line number	Diff line number	Diff line change
`@@ -42,7 +42,7 @@ namespace MishaK`
`42`	`42`	`Point< GeometryReal , 2 > d[] = { vertices[i1]-vertices[i0] , vertices[i2]-vertices[i0] };`
`43`	`43`	`SquareMatrix< double , 2 > M;`
`44`	`44`	`for( int i=0 ; i<2 ; i++ ) for( int j=0 ; j<2 ; j++ ) M(i,j) = Point< GeometryReal , 2 >::Dot( d[i] , d[j] );`
`45`		`- return M.determinant();`
	`45`	`+ return std::max< double >( 0. , M.determinant() );`
`46`	`46`	`};`
`47`	`47`	`MinimalAreaTriangulation::GetTriangulation( SquaredArea , static_cast< unsigned int >( vertices.size() ) , outputTriangles );`
`48`	`48`	`}`