When applying triangulation modifier, what kind of algorithm does Blender use when choosing the "Beauty" option for quads or polygons? Is it Delaunay triangulation on individual polygons?


After a quick look at the source code, I believe it tries to find a triangulation that leads to the best angles for each triangle (ie biggest minimum angle and smallest maximum angle).

For a quad, there are only two possible splits so it tries both.

For a polygon with more sides, it does some sort of greedy iterative search of an initial triangulation and edge rotations.

Possibilities where triangles that are flipped relative to the initial polygon are discarded.

Relevant code:


Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

Not the answer you're looking for? Browse other questions tagged or ask your own question.