1. Kaul A, O’Connor MA. Computing Minkowski sums of regular polyhedra. Tech. Rep. RC 18891. IBM Research Division, Yorktown Heights; 1993.
2. Robust geometric computation;Yap,2004
3. Computational geometry algorithms library. http://www.cgal.org/.
4. Eigenwillig A, Kerber M. Exact and efficient 2d-arrangements of arbitrary algebraic curves. In: Proceedings of the nineteenth annual ACM–SIAM symposium on discrete algorithms (SODA08). 2008. p. 122–31.
5. Exact computational geometry. http://cs.nyu.edu/exact.