An Algorithm that Computes a Lower Bound on the Distance Between a Segment and ℤ2

We give a fast algorithm for computing a lower bound on the distance between a straight line and the points of a bounded regular grid. This algorithm is used to find worst cases when trying to round the elementary functions correctly in floating-point arithmetic. These worst cases are useful to design algorithms that guarantee the exact rounding of the elementary functions.