CGAL users discussion list

[Per Zetterlund <>]

Thanks!

It says in the docs that the value type of
both the "collection" and the query iterators
should be the same. Does that mean that I
need to create a "union" of my Tetrahedra
and Point types and keep track of which
is which in the callback myself?

 /Per


On Thu, Nov 13, 2014 at 10:49 AM, 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.
>
> --
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://sympa.inria.fr/sympa/info/cgal-discuss
>
>