Inner and Outer Rounding of Boolean Operations on Lattice Polygonal Regions

Olivier Devillers 1 Philippe Guigue 1
1 GEOMETRICA - Geometric computing
CRISAM - Inria Sophia Antipolis - Méditerranée
Abstract : Robustness problems due to the substitution of the exact computation on real numbers by the rounded floating point arithmetic are often an obstacle to obtain practical implementation of geometric algorithms. If the adoption of the --exact computation paradigm--[Yap et Dube] gives a satisfactory solution to this kind of problems for purely combinatorial algorithms, this solution does not allow to solve in practice the case of algorithms that cascade the construction of new geometric objects. In this report, we consider the problem of rounding the intersection of two polygonal regions onto 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 modes construct two polygonal regions with integer vertices which respectively is included and contains the true intersection. We also prove interesting results on the Hausdorff distance, the size and the convexity of these polygonal regions.
Document type :
Journal articles
Complete list of metadatas

Cited literature [11 references]  Display  Hide  Download

https://hal.inria.fr/inria-00001250
Contributor : Olivier Devillers <>
Submitted on : Wednesday, April 12, 2006 - 4:07:01 PM
Last modification on : Wednesday, March 7, 2018 - 10:08:50 AM
Long-term archiving on : Saturday, April 3, 2010 - 9:50:40 PM

Identifiers

Collections

Citation

Olivier Devillers, Philippe Guigue. Inner and Outer Rounding of Boolean Operations on Lattice Polygonal Regions. Computational Geometry, Elsevier, 2006, 33, pp.3--17. ⟨10.1016/j.comgeo.2004.08.005⟩. ⟨inria-00001250⟩

Share

Metrics

Record views

279

Files downloads

259