The Delaunay triangulation complexity is O(n⌈d / 2⌉) where n is the number of points and d is the dimension , in this case d= 2 so you have O( n ), which is linear complexity.
I think that triangulating 300,000 points would take approxx 2 mins.
JDJason DunnLicense holderPersonal License Purchased on Oct 7, 20113 years ago
Great code that works as expected. It quickly triangulates 500+ points, removing duplicates and retaining original point indicies. Easier to use than Triangle in a c++ app and is a low-cost alternative for a commercial application.