CGAL users discussion list

[Andreas Fabri <>]

I had the same thought, but this only makes sense if
you can run the test on many points at the same time
and if the tetrahedra are "small".

andreas

On 13/11/2014 10:49, Sebastien Loriot (GeometryFactory) wrote:
> On 11/13/2014 10:45 AM, Per Zetterlund wrote:
> > Hi all,
> >
> > I have a list of (non-overlapping) tetrahedrons
> > that I want to query with a point to see
> > which (if any) tetrahedron that contains
> > the point.
> >
> > Is it possible to use the Segment tree
> > structure for this? Can the 3D "segments"
> > be tetrahedrons?
> >
> >   /Per
> I would use the fast bbox-intersection-d package for that.
>
> http://doc.cgal.org/latest/Box_intersection_d/index.html
>
> Sebastien.

--
Andreas Fabri, PhD
Chief Officer, GeometryFactory
Editor, The CGAL Project

phone: +33.492.954.912    skype: andreas.fabri