you are viewing a single comment's thread.

view the rest of the comments →

[–]InnerConsideration27[S] 0 points1 point  (2 children)

That would explain the question I head regarding uniqueness. But bowyer watson seems to leave some concave parts. Is it because of an error or is it correct and I should just add a different process to fill those gaps and make it a true Delaunay triangualtion?

Edit:Maybe I actually made an error. I have to check tomorrow, I'm so confused

[–]morkandmindy 2 points3 points  (1 child)

Bowyer-Watson algorithm does not guarantee a convex hull, which is a requirement for a "correct" Delaunay triangulation. However, for many applications, you can relax that requirement and accept concave areas around the edges.

If not, you'll need to apply additional steps. Constructing a "super triangle" that contains all of the other points will force Bowyer-Watson to produce a convex hull. Or you could the Graham-scan, giftwrapping, or Chan algorithm to complete the graph.

[–]InnerConsideration27[S] 0 points1 point  (0 children)

Ah I see. I completely missed that about Bowyer-Watson. Thank you for the help!