Fig 1. Schematic of recursion rules of the Sloppy Algorithm.

(A), Width of gray bar is to be measured with rulers of unit length (horizontal lines). Vertical tick lines are the graduation marks. Note that a graduation mark can lie beyond the edge of the ruler as seen in the middle and rightmost set of rulers. (B), s, solves the fixed point problem Q(L, s) = L. Arrows show how s _i and λ _i+1, generated by this ruler example, are linked to each other and how the algorithm converges.