Hi all,
I'm wondering if there is some routine that will do in 3D what
grid_points_in_poly() does in 2D. That is, I'd like to use the results of
a call to marching_cubes(), i.e. an array of verts, and determine which
grid points in the input volume that was provided as input to
marching_cubes are inside of the surface defined by those verts. Any help
would be appreciated.
Regards,
Jon
--
________________________________________________________
Jonathan D. Slavin Harvard-Smithsonian CfA
jslavin(a)cfa.harvard.edu 60 Garden Street, MS 83
phone: (617) 496-7981 Cambridge, MA 02138-1516
cell: (781) 363-0035 USA
________________________________________________________