CGAL users discussion list

[Sandeep Dey <>]

Hi Prateek,

The function CGAL::bounded_side_2 computes if a point lies inside a polygon. Please check the reference manual for its usage.

 #include <CGAL/Polygon_2_algorithms.h>

An example of how to use this function is also given in the Polygon chapter of the CGAL Manual. 

Hope this helps.

Best regards,

Sandeep.

On Thu, Feb 2, 2012 at 8:06 PM, pgiitu <> wrote:

Hello

I am new to CGAl and I need to check whether there is a way to check if a
line segment lies completely inside a polygon or not.
The file intersection.h in CGAL offers intersection of line vs live,
triangle vs line and many more options but not a polygon.

Can anyone help me?

--
View this message in context: http://cgal-discuss.949826.n4.nabble.com/Segment-Inside-a-Polygon-tp4352456p4352456.html
Sent from the cgal-discuss mailing list archive at Nabble.com.

--
You are currently subscribed to cgal-discuss.
To unsubscribe or access the archives, go to
https://lists-sop.inria.fr/wws/info/cgal-discuss