Coordinate representation of order types requires exponential storage
STOC '89 Proceedings of the twenty-first annual ACM symposium on Theory of computing
Snap rounding line segments efficiently in two and three dimensions
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Practical segment intersection with finite precision output
Computational Geometry: Theory and Applications
Look — a Lazy Object-Oriented Kernel for geometric computation
Proceedings of the sixteenth annual symposium on Computational geometry
Approximating Vertices of a Convex Polygon with Grid Points in the Polygon
ISAAC '92 Proceedings of the Third International Symposium on Algorithms and Computation
Snap rounding of Bézier curves
SCG '07 Proceedings of the twenty-third annual symposium on Computational geometry
Iterated snap rounding with bounded drift
Computational Geometry: Theory and Applications
PACE: polygonal approximation of thick digital curves using cellular envelope
ICVGIP'06 Proceedings of the 5th Indian conference on Computer Vision, Graphics and Image Processing
| Hi-index | 0.00 |
Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating pointarithmetic are often an obstacle to obtain practical implementation of geometric algorithms. If the adoption of the exact computation paradigm [13] gives a satisfactory solution to this kind of problemsfor purely combinatorial algorithms this solution does not allow to solvein practice the case of algorithms that cascade the construction of new geometric objects.In this paper we consider the problem of rounding the intersection of two polygonal regionsonto the integer lattice with inclusion properties. Namely given two polygonal regions A and B having their vertices on the integer lattice the inner and outer rounding modesconstruct two polygonal regions with integer vertices such that they respectively are included and containing the exact intersection of A and B. We also prove interesting results on the Hausdorff distance the size and the convexity of these polygonal regions.