Jump-and-Walk

[therealbnut]

This is just a proof-of-concept.

I was interested to see how the Jump-and-Walk algorithm would compare to your existing methods of point location. It's meant to perform better with high density clusters of points, and doesn't need any pre-sorting or maintenance of data structures.

Understandably it's worse than bulk last-used because the vertices are sorted for bulk insertion.

It's consistently slower than the hierarchy for location, but requires no hierarchy management.

The jump sampling count could probably be optimised a bit (and it's meant to be random rather than stepped, but I wanted determinism). Although I don't currently think there's a clear enough advantage to pursue it further, I thought I'd share the results in case you're interested (feel free to close this).