4 ms·
I'm startled at your triangulation time. I last did serious work with Delauney triangulation in 1998 or so, and was triangulating ~1000000 points in a few of ho
by pacaro 11y ago
I'm startled at your triangulation time. I last did serious work with Delauney triangulation in 1998 or so, and was triangulating ~1000000 points in a few of hours (on a machine with only 4MiB of RAM)
- EllipticCurve 11y agoNever tried so many points, maybe I give it a try later. I think it's part time the language choice and the fact, that my algorithm probably runs in Omega(n logn) but might not reach O(n logn)... Maybe you got an idea: My bottleneck is to find the triangle in which a new point lies. Right now I go through the triangle-mesh in the direction of the point, hoping to find the right triangle fast. Most of the time, it does ...
- pacaro 11y agoMaintaining a quad-tree of your triangles will give you O(LogN)lookup