CGAL users discussion list

[Peter Hachenberger <>]

You can convert the Polyhedron_3 to a Nef_polyhedron_3 and use the
function locate(Point_3).

Peter

On Tue, 2007-09-18 at 16:19 +0800, Dr. Liu Jianfei wrote:
> Hi, have you found it? I need the function too.
> In fact, I am developing an point-in-polyhedron program for triangle based 
> models and I need other codes for comparison.
> 
> ----- Original Message ----- 
> From: 
> <>
> To: 
> <>
> Sent: Tuesday, June 26, 2007 4:55 AM
> Subject: [cgal-discuss] point location
> 
> 
> > 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 
> > -- 
> > You are currently subscribed to cgal-discuss.
> > To unsubscribe or access the archives, go to
> > https://lists-sop.inria.fr/wws/info/cgal-discuss
>