Well, when your samples are x or y ordered you could use a binary search algo, what is O(log n) instead of O(n) like in your code. F.e. have a look at CurveTracker::curveLineAt() in playground/curvetracker/curvetracker.cpp.
Uwe
Well, when your samples are x or y ordered you could use a binary search algo, what is O(log n) instead of O(n) like in your code. F.e. have a look at CurveTracker::curveLineAt() in playground/curvetracker/curvetracker.cpp.
Uwe
Bookmarks