C. K. Yap and T. Dubé, THE EXACT COMPUTATION PARADIGM, Computing in Euclidean Geometry of Lecture Notes Series on Computing, pp.452-492, 1995.
DOI : 10.1142/9789812831699_0011

S. Funke and K. Mehlhorn, Look --- a Lazy Object-Oriented Kernel for geometric computation, Proceedings of the sixteenth annual symposium on Computational geometry , SCG '00, pp.156-165, 2000.
DOI : 10.1145/336154.336196

D. H. Greene and F. F. Yao, Finite-resolution computational geometry, 27th Annual Symposium on Foundations of Computer Science (sfcs 1986), pp.143-152, 1986.
DOI : 10.1109/SFCS.1986.19

M. Goodrich, L. J. Guibas, J. Hershberger, and P. Tanenbaum, Snap rounding line segments efficiently in two and three dimensions, Proceedings of the thirteenth annual symposium on Computational geometry , SCG '97, pp.284-293, 1997.
DOI : 10.1145/262839.262985

L. Guibas and D. Marimont, Rounding Arrangements Dynamically, International Journal of Computational Geometry & Applications, vol.08, issue.02, pp.157-176, 1998.
DOI : 10.1142/S0218195998000096

J. D. Hobby, Practical segment intersection with finite precision output, Computational Geometry, vol.13, issue.4, pp.199-214, 1999.
DOI : 10.1016/S0925-7721(99)00021-8
URL : http://doi.org/10.1016/s0925-7721(99)00021-8

V. J. Milenkovic, Shortest Path Geometric Rounding, Algorithmica, vol.27, issue.1, pp.57-86, 2000.
DOI : 10.1007/s004530010004

S. Fortune, Vertex-Rounding a Three-Dimensional Polyhedral Subdivision, Discrete & Computational Geometry, vol.22, issue.4, pp.593-618, 1999.
DOI : 10.1007/PL00009480

V. J. Milenkovic, Practical methods for set operations on polygons using exact arithmetic, Proc. 7th Canad. Conf, pp.55-60, 1995.

P. Guigue, Constructions géométriquesgéométriquesà précision fixée, Thèse de doctorat en sciences, 2003.

H. S. Lee and R. C. Chang, Approximating vertices of a convex polygon with grid points in the polygon, Proc. 3rd Annu. Internat. Sympos, pp.269-278, 1992.
DOI : 10.1007/3-540-56279-6_80