Inner and Outer Rounding of Boolean Operations on Lattice Polygonal Regions

Details Inner and Outer Rounding of Boolean Operations on Lattice Polygonal Regions Inner and Outer Rounding of Boolean Operations on Lattice Polygonal Regions

2006-04-13

arxiv.org/abs/cs/0604059v1

Computer Science

Computational Geometry

Scientific paper

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.

Affiliated with

Also associated with

No associations

Rating

Inner and Outer Rounding of Boolean Operations on Lattice Polygonal Regions does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Inner and Outer Rounding of Boolean Operations on Lattice Polygonal Regions, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Inner and Outer Rounding of Boolean Operations on Lattice Polygonal Regions will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-514634