F. Avnaim, J. Boissonnat, O. Devillers, F. Preparata, and M. Yvinec, Evaluating signs of determinants using single-precision arithmetic, Algorithmica, vol.37, issue.6, 1994.
DOI : 10.1007/BF02522822
URL : https://hal.archives-ouvertes.fr/inria-00074367

B. Chazelle, Triangulating a simple polygon in linear time, Discrete & Computational Geometry, vol.15, issue.3, pp.485-524, 1991.
DOI : 10.1007/BF02574703

B. Chazelle and H. Edelsbrunner, An optimal algorithm for intersecting line segments in the plane, Journal of the ACM, vol.39, issue.1, pp.1-54, 1992.
DOI : 10.1145/147508.147511

P. Dagum, R. Karp, M. Luby, and S. Ross, An optimal algorithm for Monte Carlo estimation (extended abstract), 36th Annual Symposium on Foundations of Computer Science, pp.142-149, 1995.

M. Berg, Computational geometry by example, 1996.

M. Dyer, A. Frieze, and R. Kannan, A random polynomial time algorithm for approximating the volume of convex bodies, ACM STOC, pp.375-381, 1989.

W. H. Elmaraghy, Intersection volumes and surface areas of cylinders for geometrical modelling and tolerancing, Computer-Aided Design, vol.26, issue.1, pp.29-45, 1994.
DOI : 10.1016/0010-4485(94)90005-1

S. Fang and B. Brüderlin, Robustness in geometric modeling ??? Tolerance-based methods, Computational Geometry ? Methods, Algorithms and Applications: Proc. Internat. Workshop Comput. Geom. CG '91, pp.85-101, 1991.
DOI : 10.1007/3-540-54891-2_7

U. Finke and K. Hinrichs, Overlaying simply connected planar subdivisions in linear time, Proceedings of the eleventh annual symposium on Computational geometry , SCG '95, 1995.
DOI : 10.1145/220279.220292

K. Fung, Simplified linear-time jordan sorting and polygon clipping, Information Processing Letters, vol.35, issue.2, p.35, 1990.
DOI : 10.1016/0020-0190(90)90111-A

L. J. Guibas, D. Salesin, and J. Stolfi, Epsilon geometry: building robust algorithms from imprecise computations, Proc. 5th Annu. ACM Sympos, pp.208-217, 1989.

J. Latombe, R. H. Wilson, and F. Cazals, Assembly sequencing with toleranced parts, Computer Aided Design, vol.29, issue.2, 1997.

J. Lawrence, Polytope volume computation, Mathematics of Computation, vol.57, issue.195, pp.259-71, 1991.
DOI : 10.1090/S0025-5718-1991-1079024-2

B. Moller, Tolerances in product modelling, Informatik, Informationen Reporte, issue.5, pp.4-52, 1991.

R. Motwani and P. Raghavan, Randomized Algorithms, 1995.

J. Nievergelt and F. Preparata, Plane-sweep algorithms for intersecting geometric figures, Communications of the ACM, vol.25, issue.10, p.25, 1982.
DOI : 10.1145/358656.358681

F. P. Preparata and M. I. Shamos, Computational Geometry: An Introduction, 1985.
DOI : 10.1007/978-1-4612-1098-6

U. Roy, C. R. Liu, and T. C. Woo, Review of dimensioning and tolerancing: representation and processing, Computer-Aided Design, vol.23, issue.7, pp.466-83, 1991.
DOI : 10.1016/0010-4485(91)90045-X

D. H. Salesin, Epsilon geometry: building robust algorithms from imprecise computations, Proceedings of the fifth annual symposium on Computational geometry , SCG '89, 1991.
DOI : 10.1145/73833.73857

J. R. Shewchuk, Robust adaptive floating-point geometric predicates, Proceedings of the twelfth annual symposium on Computational geometry , SCG '96, pp.141-150, 1996.
DOI : 10.1145/237218.237337
URL : http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.53.6004

V. Srinivasan, Recent efforts in mathematization of asme/ansi y14.5m standard. In 3 rd CIRP seminars on computer aided tolerancing, 1993.

R. K. Walker and V. Srinivasan, Creation and evolution of the asme y14.5.1 standard, Manufacturing Review, vol.7, issue.1, 1994.

N. Wang and T. M. Ozsoy, A scheme to represent features, dimensions, and tolerances in geometric modeling, Journal of Manufacturing Systems, vol.10, issue.3, pp.233-273, 1991.
DOI : 10.1016/0278-6125(91)90036-2