Inner and Outer Rounding of Set Operations on Lattice Polygonal Regions - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Reports Year : 2003

Inner and Outer Rounding of Set Operations on Lattice Polygonal Regions

Olivier Devillers
Philippe Guigue
  • Function : Author

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 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 and having their vertices on the integer lattice, the inner and outer rounding modes construct two polygonal regions and with integer vertices such that . We also prove interesting results on the Hausdorff distance, the size and the convexity of these polygonal regions.
Fichier principal
Vignette du fichier
RR-5070.pdf (310.05 Ko) Télécharger le fichier
Loading...

Dates and versions

inria-00071513 , version 1 (23-05-2006)

Identifiers

  • HAL Id : inria-00071513 , version 1

Cite

Olivier Devillers, Philippe Guigue. Inner and Outer Rounding of Set Operations on Lattice Polygonal Regions. RR-5070, INRIA. 2003. ⟨inria-00071513⟩
92 View
180 Download

Share

Gmail Mastodon Facebook X LinkedIn More