CGAL users discussion list

Hi Laurent,

i asked today, unfortunately i am not allowed to give the code away, sorry.

regards,
Jim

----- Ursprüngliche Nachricht -----
Von: Laurent Rineau 
<>
Datum: Montag, Juni 25, 2007 11:36 pm
Betreff: Re: [cgal-discuss] point location
An: 


> On Monday 25 June 2007 22:55:11 
> 
>  wrote:
> > 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.
> 
> Hi Jim,
> 
> Is your implementation of kd-trees free of rights? I would need 
> one, actually, for experimental uses.
> 
> -- 
> Laurent Rineau
> INRIA - Sophia Antipolis
> BP 93, 2004 Route des Lucioles
> 06902 Sophia Antipolis Cedex FRANCE
> -- 
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss
>