CGAL users discussion list

[Ashwin Nanjappa <>]

 wrote:
> @~ash
> Thank you for the reply. Which is the right routine for computing the 
> intersection? This one:
>
> CGAL::intersection ( Type1<Kernel> obj1, Type2<Kernel> obj2)
>
> is just for the types: Line_2, Segment_2,...
>
> Which routine can I use for the voronoi edges ?

See:
<http://www.cgal.org/Manual/3.3.1/doc_html/cgal_manual/Kernel_23_ref/Function_intersection.html>

You can intersect a Iso_rectangle_2 with a Segment_2. A Voronoi edge is a 
Segment_2. You could form a Iso_rectangle_2 around your polygon and 
intersect it with Segment_2 to get the intersection point. Then check if 
this point lies on the polygon by using its bounded_side() function.

~ash