CGAL users discussion list

[ax487 <>]

Hello all,

I am using the intersection function (
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Boolean_set_operations_2_ref/Function_intersection.html)
to calculate the intersection of a number of polygons. The function
works fine for me, however I would like to know how the function is
implemented.
I noticed that the documentation for the optimal_convex_partition_2
function (
http://www.cgal.org/Manual/latest/doc_html/cgal_manual/Partition_2_ref/Function_optimal_convex_partition_2.html)
comes with a reference to a paper which contains a description of the
algorithm. Since polygon intersection appears to me to be a nontrivial
algorithm as well, I am sure that there is some paper that explains the
algorithm you are implementing. I would appreciate it if you could tell
me where to find it.

ax487