CGAL users discussion list

Hi CGAL Users,

is there any method in CGAL to find out whether a point is located inside or 
outside a Polyhedron_3. I currently use a non-CGAL kd-tree for triangles to 
count the intersections of a ray. But it would be more convenient (and maybe 
faster?) if I could use a CGAL method, since I use CGAL for everything else.

Thank you in advance,
Jim