CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

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.