Re: Efficient Voxel Interpolation / Splatting
Manuel Massing <[email protected]> Sun, 13 Jun 2010 18:21:02 +0200
| Newsgroups | gmane.games.devel.algorithms |
|---|---|
| Message-ID | <[email protected]> |
Hi Stefan, > 1. Find the nearest pixel to a voxel and assign the color of the pixel to > the voxel (nearest Neighbor) > 2. Find the n-nearest pixels to a voxel and weight the color-contribution > of these pixels inverse linearly with the distance of the pixels to the > voxel 3. Find the nearest pixels within a pre-defined distance to the > voxel and weight the color-contribution of these pixels inverse linearly > with the distance to the voxel Have you considered just using a 3D DDA which traces each 2d image through the voxel grid? This might be more efficient, although it will require a larger working set (because it involves collection of a number of contributing pixels and filtering them as a post-process). cheers, Manuel ------------------------------------------------------------------------------ ThinkGeek and WIRED's GeekDad team up for the Ultimate GeekDad Father's Day Giveaway. ONE MASSIVE PRIZE to the lucky parental unit. See the prize list and enter to win: http://p.sf.net/sfu/thinkgeek-promo _______________________________________________ GDAlgorithms-list mailing list [email protected] https://lists.sourceforge.net/lists/listinfo/gdalgorithms-list Archives: http://sourceforge.net/mailarchive/forum.php?forum_name=gdalgorithms-list