Looks like it’s modified ear-clipping, based onhttps://github.com/mapbox/earcut
-
-
Pathfinder could be O(n log n) by storing the active edge list as a red-black tree as in the paper, I think, but it’s not worth it in practice because of constant factor overhead…
-
Thanks for the link - I couldn't find much description on Pathfinder when I googled it just now (I did however find your blog post https://pcwalton.github.io/2017/02/14/pathfinder.html …).
- 2 more replies
New conversation -
-
-
There are a range of Delaunay triangulation algorithms with very good efficiency, such as Fortune’s, which is rather beautiful: https://en.wikipedia.org/wiki/Fortune%27s_algorithm …
-
This is non-constrained Delaunay, which is relatively simple and can be O(n log n) in average. See https://github.com/mapbox/delaunator … for my take. But Constrained Delaunay (which is necessary for tessellation) is many times more difficult and expensive.
- 1 more reply
New conversation -
Loading seems to be taking a while.
Twitter may be over capacity or experiencing a momentary hiccup. Try again or visit Twitter Status for more information.

