It is probably useful to mention that many triangulation algorithms that people may think of after a couple minutes of effort without referencing existing work struggle to produce anything reasonable when given a curved object that has spiky points adjacent to curves, such as in the simple case of a cone.
Algorithms that can solve these triangulations with no additional resource usage are widespread nowadays, but they were a tough problem in the 70s and 80s.
The trick is to maximise the minimum angle inside all triangles, so that no triangle has a very small angle, in combination with carefully choosing the starting points for the triangulation.
Algorithms that can solve these triangulations with no additional resource usage are widespread nowadays, but they were a tough problem in the 70s and 80s.
The trick is to maximise the minimum angle inside all triangles, so that no triangle has a very small angle, in combination with carefully choosing the starting points for the triangulation.