Abstract: Fast C implementations of four geometric predicates, the
2D and 3D orientation and incircle tests, are publicly available.
Their inputs are ordinary single or double precision
floating-point numbers. They owe their speed to two features.
First, they employ new fast algorithms for arbitrary
precision arithmetic that have a strong advantage over other
software techniques in computations that manipulate values
of extended but small precision. Second, they are adaptive;
their running time depends... (Update)
.... geometry and solid modelling communities, there has been a lot of work on the related problem of robust geometric computing [45, 56, 57, 91, 95, 99, 105, 107]. These techniques are not applicable to our problem since they attempt to avoid errors caused by numerical imprecision...
...we end up with consist in evaluating the sign of algebraic expressions (sections 2.2.2 and 3. 1) The reader is referred to [20, 1] for recent developments in this area. # 1 # 2 Figure 1: a)Intersection of two toleranced polygons (b)Worst case example of intersection...
J.R. Shewchuk. Robust Adaptive Floating-Point Geometric Predicates. In Proc. 12th Annu. ACM Sympos. Comput. Geom., pages 141--150, Philadelphia, PA, USA, June 1996. http://citeseer.nj.nec.com/shewchuk96robust.html More
@inproceedings{ shewchuk96robust,
author = "Jonathan Richard Shewchuk",
title = "Robust Adaptive Floating-Point Geometric Predicates",
booktitle = "Symposium on Computational Geometry",
pages = "141-150",
year = "1996",
url = "citeseer.nj.nec.com/shewchuk96robust.html" }