Skip to Content.
Sympa Menu

cgal-discuss - Re: [cgal-discuss] Segment tree and tetrahedron

Subject: CGAL users discussion list

List archive

Re: [cgal-discuss] Segment tree and tetrahedron


Chronological Thread 
  • From: "Sebastien Loriot (GeometryFactory)" <>
  • To:
  • Subject: Re: [cgal-discuss] Segment tree and tetrahedron
  • Date: Thu, 13 Nov 2014 14:32:01 +0100
  • Organization: GeometryFactory

On 11/13/2014 02:17 PM, Per Zetterlund wrote:
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?


Value type should be a bbox type that can hold
a point or a tetrahedron.

Sebastien.

/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







Archive powered by MHonArc 2.6.18.

Top of Page