Explorar o código

Merge pull request #78368 from MatthewLJensen/delaunay-fixes

Consider all triangles for retention in Delaunay Triangulation
Rémi Verschelde %!s(int64=2) %!d(string=hai) anos
pai
achega
127e9d65cf
Modificáronse 1 ficheiros con 1 adicións e 1 borrados
  1. 1 1
      core/math/delaunay_2d.h

+ 1 - 1
core/math/delaunay_2d.h

@@ -145,7 +145,7 @@ public:
 		// Filter out the triangles containing vertices of the bounding triangle.
 		// Filter out the triangles containing vertices of the bounding triangle.
 		int preserved_count = 0;
 		int preserved_count = 0;
 		Triangle *triangles_ptrw = triangles.ptrw();
 		Triangle *triangles_ptrw = triangles.ptrw();
-		for (int i = 0; i < triangles.size() - 1; i++) {
+		for (int i = 0; i < triangles.size(); i++) {
 			if (!(triangles[i].points[0] >= point_count || triangles[i].points[1] >= point_count || triangles[i].points[2] >= point_count)) {
 			if (!(triangles[i].points[0] >= point_count || triangles[i].points[1] >= point_count || triangles[i].points[2] >= point_count)) {
 				triangles_ptrw[preserved_count] = triangles[i];
 				triangles_ptrw[preserved_count] = triangles[i];
 				preserved_count++;
 				preserved_count++;