An optimal worst case algorithm for reporting intersections of rectangles, p.29, 1980. ,
An intersection-sensitive algorithm for snap rounding, Computational Geometry, vol.36, issue.3, pp.159-165, 2007. ,
3D Snap Rounding, SoCG 2018 -34th International Symposium on Computational Geometry, vol.30, 2018. ,
URL : https://hal.archives-ouvertes.fr/hal-01727375
Vertex-rounding a three-dimensional polyhedral subdivision, Discrete & Computational Geometry, vol.22, issue.4, pp.593-618, 1999. ,
Snap rounding line segments efficiently in two and three dimensions, Proceedings of the thirteenth annual symposium on Computational geometry, pp.284-293, 1997. ,
Finite-resolution computational geometry, 27th Annual Symposium on Foundations of Computer Science, pp.143-152, 1986. ,
Rounding arrangements dynamically, International Journal of Computational Geometry & Applications, vol.8, issue.02, pp.157-178, 1998. ,
Iterated snap rounding, Computational Geometry, vol.23, issue.2, pp.209-225, 2002. ,
Sylvain Pion, and Stefan Schirra. Number types, CGAL User and Reference Manual, 2019. ,
Improved output-sensitive snap rounding, Discrete & Computational Geometry, vol.39, issue.1, pp.298-318, 2008. ,
Stable snap rounding, Computational Geometry, vol.46, issue.4, pp.403-416, 2013. ,
Practical segment intersection with finite precision output, Computational Geometry, vol.13, issue.4, pp.199-214, 1999. ,
Halfedge data structures, CGAL User and Reference Manual, 2019. ,
Finding compact coordinate representations for polygons and polyhedra, IBM Journal of Research and Development, vol.34, issue.35, pp.753-769, 1990. ,
Iterated snap rounding with bounded drift, Computational Geometry, vol.40, issue.3, pp.231-251, 2008. ,
CGAL User and Reference Manual, 2019. ,
Mesh arrangements for solid geometry, ACM Transactions on Graphics (TOG), vol.35, issue.4, 2016. ,
Thingi10k: A dataset of 10, 000 3d-printing models, 2016. ,