[vtkusers] Breaking down triangulated mesh into regions bound by equally sized cubes

[Alexander MacLennan]

Thanks David, I'll check it out

alex

-----Original Message-----
From: David Doria [mailto:daviddoria at gmail.com] 
Sent: Thursday, February 03, 2011 4:28 AM
To: Alexander MacLennan
Cc: vtkusers at vtk.org
Subject: Re: [vtkusers] Breaking down triangulated mesh into regions bound
by equally sized cubes

On Thu, Feb 3, 2011 at 12:06 AM, Alexander MacLennan
<alexander_maclennan at hotmail.com> wrote:
> Hi,
>
>
>
> I've been looking for a code fragment that takes a triangulated mesh 
> in VTK (3d surface) and breaks it down into regions bound by equally sized
cubes.
> It's a simple way to select vertices using a uniform sample rate.
>
>
>
> I haven't had much luck finding existing vtk functions that could do 
> this for me, has anyone done this before with VTK?
>
>
>
> Thanks
>
> alex

If you're interested in sampling a mesh, this algorithm is great:
http://www.midasjournal.org/browse/publication/719

It is adaptive rather than uniform.

You could also check out:
http://www.vtk.org/Wiki/VTK/Examples/Broken/GridPointCloud
http://www.vtk.org/Wiki/VTK/Examples/Cxx/PolyData/DownsamplePointCloud
http://www.vtk.org/Wiki/VTK/Examples/Cxx/PolyData/PolyDataPointSampler
http://www.midasjournal.org/browse/publication/713

David