[vtkusers] Re: vtkusers Digest, Vol 32, Issue 16

[Jean-Do Barnichon]

Hi Andrea,
I think the class vtkCollisionDetector (based on OBBTree) proposed by 
Goodwin Lawlor could do the job.
You should be able to get info about it in the vtk archive.
Jean-Do
> Message: 2
> Date: Wed, 13 Dec 2006 17:59:12 +0000
> From: "Andrea Gavana" <andrea.gavana at gmail.com>
> Subject: [vtkusers] Grid intersections?
> To: vtkusers at vtk.org
> Message-ID:
> 	<d5ff27200612130959k2f3fd2dnaf6018fb0fd7afe5 at mail.gmail.com>
> Content-Type: text/plain; charset=ISO-8859-1; format=flowed
>
> Hi all,
>
>    I have a 3D unstructured grid (a reservoir representation) and I
> am faced with a challenge for which I don't even know if a solution
> exists. If it exists, I don't know where to look for it. I've googled
> around quite a bit but got zero clues.
> Based on 3 user inputs (width, height, depth), I would like to
> construct some kind of parallelepiped and then I would like to move it
> (in x, y, z directions sequentially) inside my 3D unstructred grid:
> for evey move, I would like to know which cells of my 3D grid are
> intersected by this parallelepiped. Actually, the parallelepiped will
> be distorted, as the 3D grid is not orthogonal (is a corner point
> grid), so the problem looks like a 3D unstructured grid that
> intersects a smaller 3D unstructured grid, and I would like to find
> out which cells of the bigger grid are intersected by the smaller one.
> It is like a moving 3D window inside the bigger grid.
> Does anyone have a suggestion or a comment to share?
>
> Thank you for every hint.
>
>