[vtkusers] Voxels

[Dominik Szczerba]

You will basically need a test routine to tell you if a given point
lies inside your triangular surface or outside. There is such a test
in VTK, but should you want to write your own one again, this is about
shooting rays and counting intersections. Sounds simple, but it is not
so to do efficiently and robustly.

Dominik

On Tue, Jul 5, 2011 at 3:47 PM, Alex Southern <mrapsouthern at gmail.com> wrote:
> Hi,
>
> I have a closed triangular surface mesh, that I would like to represent as a
> volume of identically sized cubes. I understand this is known as
> voxelization where a single cube is referred to as a voxel.
>
> I am aware that VTK will probably do this for me. Though, for various
> reasons, I would like to implement this algorithm myself, can anyone give me
> a clue as to how to tackle this problem from the ground up? References would
> be great.
>
> Thanks
> Alex
>
>
>
>
> _______________________________________________
> Powered by www.kitware.com
>
> Visit other Kitware open-source projects at
> http://www.kitware.com/opensource/opensource.html
>
> Please keep messages on-topic and check the VTK FAQ at:
> http://www.vtk.org/Wiki/VTK_FAQ
>
> Follow this link to subscribe/unsubscribe:
> http://www.vtk.org/mailman/listinfo/vtkusers
>
>