CGAL users discussion list

["Tomislav Maric" <>]

Here is the screenshot. The boxes are axis aligned. If the mesh gets refined 
(octree refinement), the computation of intersections is repeated (it has to 
be anyway). 

Hope this helps... and thank you very much for your help! :)

Tomislav

> ----- Original Message -----
> From: Sebastien Loriot (GeometryFactory)
> Sent: 02/28/12 02:45 PM
> To: 
> 
> Subject: Re: [cgal-discuss] Polyhedron_3 points / Array of boxes
> 
> How is you hexa-mesh? is it regular or arbitrary? are the boxes 
> axis-aligned?
> 
> A screenshot can be helpful too if you have one.
> 
> Sebastien.
> 
> On 02/28/2012 11:22 AM, Tomislav Maric wrote:
> > Hi everyone,
> >
> > what would be the fastest way to compute something like "point in box" 
> > for the points of the Polyhedron_3? I have an array of boxes (extremely 
> > large, well over hundreds of thousands) and a rather large Polyhedron_3 
> > depicting a surface mesh. What I am aiming at is a fast way of 
> > communicating data between an underlying hexahedral mesh (array of boxes) 
> > and the vertices of the Polyhedron..
> >
> > I've read the chapter on Intersecting sequences of d-Dimensional boxes, 
> > and I'm thinking about this:
> >
> > 1) Create an array of boxes for the Polyhedron_3 facets (triangular mesh)
> > 2) Create an array of boxes for the hex mesh.
> > 3) Compute the intersection test.
> > 4) Sub process: go through every triangle, take the point of the triangle 
> > and find the box (out of the candidates given by the intersection test) 
> > within which the point is located.
> >
> > This sounds a bit... slow... so any advice is appreciated! :)
> >
> > Thanks!
> >
> > Tomislav
> >
> 
> 
> -- 
> You are currently subscribed to cgal-discuss.
> To unsubscribe or access the archives, go to
> https://lists-sop.inria.fr/wws/info/cgal-discuss

Attachment: screenshot.jpg
Description: Attachment: screenshot.jpg