although it's rare, if there's a case where a zero-angle triangle is *required* to close up a face (MWT determines it's part of the optimal case), we'll just let it through
This commit is contained in:
parent
c9935aaa38
commit
3fc6225fee
|
|
@ -464,7 +464,7 @@ std::vector<qvectri> minimum_weight_triangulation(const std::vector<size_t> &ind
|
||||||
vec_t weight;
|
vec_t weight;
|
||||||
|
|
||||||
if (!TriangleIsValid(indices[i], indices[j], indices[k], 0.01)) {
|
if (!TriangleIsValid(indices[i], indices[j], indices[k], 0.01)) {
|
||||||
weight = std::numeric_limits<vec_t>::infinity();
|
weight = std::nexttoward(std::numeric_limits<vec_t>::max(), 0.0);
|
||||||
} else {
|
} else {
|
||||||
weight = (qv::distance(vertices[i], vertices[j]) +
|
weight = (qv::distance(vertices[i], vertices[j]) +
|
||||||
qv::distance(vertices[j], vertices[k]) +
|
qv::distance(vertices[j], vertices[k]) +
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue