\( \newcommand{\E}{\mathrm{E}} \) \( \newcommand{\A}{\mathrm{A}} \) \( \newcommand{\R}{\mathrm{R}} \) \( \newcommand{\N}{\mathrm{N}} \) \( \newcommand{\Q}{\mathrm{Q}} \) \( \newcommand{\Z}{\mathrm{Z}} \) \( \def\ccSum #1#2#3{ \sum_{#1}^{#2}{#3} } \def\ccProd #1#2#3{ \sum_{#1}^{#2}{#3} }\)
CGAL 5.0.1 - 2D Snap Rounding
Bibliography
[1]

M. Goodrich, L. J. Guibas, J. Hershberger, and P. Tanenbaum. Snap rounding line segments efficiently in two and three dimensions. In Proc. 13th Annu. ACM Sympos. Comput. Geom., pages 284–293, 1997.

[2]

Leonidas Guibas and David Marimont. Rounding arrangements dynamically. Internat. J. Comput. Geom. Appl., 8:157–176, 1998.

[3]

D. Halperin and E. Packer. Iterated snap rounding. Computational Geometry: Theory and Applications, 23(2):209–225, 2002.

[4]

J. D. Hobby. Practical segment intersection with finite precision output. Comput. Geom. Theory Appl., 13(4):199–214, October 1999.