Consistent digital line segments

We introduce a novel and general approach for digitalization of line segments in the plane that satisfies a set of axioms naturally arising from Euclidean axioms. In particular, we show how to derive such a system of digital segments from any total order on the integers. As a consequence, using a well-chosen total order, we manage to define a system of digital segments such that all digital segments are, in Hausdorff metric, optimally close to their corresponding Euclidean segments, thus giving an explicit construction that resolves the main question of [1].

[1]  Martin Nöllenburg,et al.  Consistent digital rays , 2008, SCG '08.

[2]  Leonidas J. Guibas,et al.  Snap rounding line segments efficiently in two and three dimensions , 1997, SCG '97.

[3]  W. Schmidt On irregularities of distribution vii , 1972 .

[4]  William W. L. Chen On irregularities of distribution. , 1980 .

[5]  Azriel Rosenfeld,et al.  Digital straightness - a review , 2004, Discret. Appl. Math..

[6]  F. Frances Yao,et al.  Finite-resolution computational geometry , 1986, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986).

[7]  Kokichi Sugihara,et al.  Robust Geometric Computation Based on Topological Consistency , 2001, International Conference on Computational Science.