Consider all triangles for retention in Delaunay Triangulation
This commit is contained in:
parent
c0d8d91b15
commit
8b188bda52
|
@ -145,7 +145,7 @@ public:
|
|||
// Filter out the triangles containing vertices of the bounding triangle.
|
||||
int preserved_count = 0;
|
||||
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)) {
|
||||
triangles_ptrw[preserved_count] = triangles[i];
|
||||
preserved_count++;
|
||||
|
|
Loading…
Reference in New Issue