Performance issues with many Samples and closestPoint()

[Uwe]

TI am not totally happy with getting the sample coresponding the the x-coordinate of the cursor.
Is there any way of getting a "snap" (besides closestPoint() ), maybe something like a closestPoint() of an smaler area of my x value?

You now find the upper index of the point corresponding to the current mouse position with a faster compare method and in O(log n) instead of O(n) - that's all.
If you like to run some local algo over maybe n points below and above the index, why not ?

F.e the curvetracker example interpolates between the adjacent points to guess a y coordinate for positions, where no sample exists.

Uwe

[AxelP]

I wrote a funktion like closestPoint() now, but let it search from 'x-position - 250000 samples' to 'x-position + 250000 samples', instead the whole curve. This makes the cursor also snap to edges at huge amount of samples, when the cursor comes close to the curve.
I am pretty happy with this now. Thanks Uwe for all the help!

Axel