CGAL users discussion list

["naresh" <>]

Hi Pierre

Where is exactly demo located ? I tried to find it . Is it in example 
directory or demo directory ?



----- Original Message ----- 
From: "Pierre Alliez" <>
To: 
<>
Sent: Tuesday, March 31, 2009 12:48 PM
Subject: Re: [cgal-discuss] Using Spatial Search (Kd-tree) to find 
segment-mesh


> hi Edson,
>
> from our experience an AABB tree a la OPCODE is even faster.
>
> from CGAL-3.4 you can already experiment the surface remeshing demo in the 
> Polyhedron demo - which uses the undocumented AAABB tree data structure. 
> we can achieve ~100K queries per sec on a 100K triangle surface mesh.
>
> please let us know how it goes in your application - as we are preparing a 
> documented component for one future release.
>
> Pierre Alliez
> INRIA Sophia Antipolis - Mediterranee Project-team GEOMETRICA 
> http://www-sop.inria.fr/members/Pierre.Alliez/
> Tel: +33 4 92 38 76 77
> Fax: +33 4 97 15 53 95
>
>
>
> Edson Tadeu a écrit :
> > Can CGAL Kd-tree (Spatial Search) be used to find the intersection 
> > between a line segment (or ray) and a mesh composed of 3D triangles?
> >
> > Like in: http://www.cs.uoi.gr/~fudos/grad-exer1/doc/a00045.html 
> > <http://www.cs.uoi.gr/%7Efudos/grad-exer1/doc/a00045.html> 
> > (asr::KDTree::intersect)
> >
> > Thanks,
> >   Edson
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss