D. Mark-de-berg, M. Halperin, and . Overmars, An intersection-sensitive algorithm for snap rounding, Computational Geometry, vol.36, issue.3, pp.159-165, 2007.
DOI : 10.1016/j.comgeo.2006.03.002

O. Devillers, M. Karavelas, and M. Teillaud, Qualitative Symbolic Perturbation: Two Applications of a New Geometry-based Perturbation Framework, Journal of Computational Geometry, vol.8, issue.1, pp.282-315, 2017.
URL : https://hal.archives-ouvertes.fr/hal-01586511

S. Fortune, Polyhedral modelling with multiprecision integer arithmetic, Computer-Aided Design, vol.29, issue.2, pp.123-133, 1016.
DOI : 10.1016/S0010-4485(96)00041-3

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

URL : http://www.cs.duke.edu/CGC/workshop97/papers/fortune-full.ps

T. Michael, L. J. Goodrich, J. Guibas, P. J. Hershberger, and . Tanenbaum, Snap rounding line segments efficiently in two and three dimensions, Proceedings of the thirteenth annual symposium on Computational geometry, pp.284-293, 1997.

H. Daniel, F. F. Greene, and . Yao, Finite-resolution computational geometry, 27th Annual Symposium on, pp.143-152, 1986.

L. J. Guibas and D. H. Marimont, Rounding Arrangements Dynamically, International Journal of Computational Geometry & Applications, vol.08, issue.02, pp.157-178, 1998.
DOI : 10.1016/S0747-7171(08)80064-8

URL : http://www.nxpdata.com/home/marimont/pubs/rounding-arrangements.ps

D. Halperin and E. Packer, Iterated snap rounding, Computational Geometry, vol.23, issue.2, pp.209-22510, 2002.
DOI : 10.1016/S0925-7721(01)00064-5

URL : https://doi.org/10.1016/s0925-7721(01)00064-5

J. Hershberger, Improved Output-Sensitive Snap Rounding, Discrete & Computational Geometry, vol.2, issue.4, pp.298-318, 2008.
DOI : 10.1016/S0925-7721(99)00021-8

J. Hershberger, Stable snap rounding, Computational Geometry, vol.46, issue.4, pp.403-416, 2013.
DOI : 10.1016/j.comgeo.2012.02.011

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

URL : https://doi.org/10.1016/s0925-7721(99)00021-8

V. Milenkovic and L. R. Nackman, Finding compact coordinate representations for polygons and polyhedra, IBM Journal of Research and Development, vol.34, issue.5, pp.753-769, 1990.
DOI : 10.1147/rd.345.0753

URL : http://www.cs.miami.edu/~vjm/Papers/ibmj.ps.gz

V. Milenkovic, Rounding face lattices in d dimensions, Proceedings of the 2nd Canadioan Conference on Computational geometry, pp.40-45, 1990.

E. Packer, Iterated snap rounding with bounded drift, Computational Geometry, vol.40, issue.3, pp.231-251, 2008.
DOI : 10.1016/j.comgeo.2007.09.002