1. Polygon decomposition for efficient construction of Minkowski sums;Agarwal;Computational Geometry: Theory and Applications,2002
2. A computational basis for conic arcs and Boolean operations on conic polygons;Berberich,2002
3. Computational geometry: Algorithms and applications;de Berg,2000
4. Flato E. Robust and efficient construction of planar Minkowski sums. Master’s thesis. School of Computer Science, Tel-Aviv University; 2000. http://www.cs.tau.ac.il/CGAL/Theses/flato/thesis/
5. Fogel E, Wein R, Zukerman B, Halperin D. 2D regularized Boolean set-operations. In: Cgal Editorial Board, editor. Cgal-3.2 user and reference manual. http://www.cgal.org/Manual/3.2/doc_html/cgal_manual/Boolean_set_operations_2/Chapter_main.html, 2006