Robust Geometric Computation Based on Topological Consistency
ICCS '01 Proceedings of the International Conference on Computational Sciences-Part I
Digital straightness: a review
Discrete Applied Mathematics - The 2001 international workshop on combinatorial image analysis (IWCIA 2001)
Finite-resolution computational geometry
SFCS '86 Proceedings of the 27th Annual Symposium on Foundations of Computer Science
Discrete & Computational Geometry - Special Issue: 24th Annual Symposium on Computational Geometry
Maximum weight digital regions decomposable into digital star-shaped regions
ISAAC'11 Proceedings of the 22nd international conference on Algorithms and Computation
Algorithms for computing the maximum weight region decomposable into elementary shapes
Computer Vision and Image Understanding
| Hi-index | 0.00 |
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].