Feature Column from the AMS
A nice refresher for Bézier curvesAnti-Grain Geometry - Interpolation with Bezier Curves
ベジェのスムースアルゴリズムSNA Projects Blog : Beating Binary Search
Quick, what is the fastest way to search a sorted array? Binary search, right? Wrong. There is actually a method called interpolation search, in which, rather than pessimistically looking in the middle of the array, you use a model of the key distribution to predict the location of the key and look there.
Interploating search with alogrithm