CGAL users discussion list

["Sebastien Loriot (GeometryFactory)" <>]

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