TY - GEN
T1 - Constructing 3D elliptical gaussians for irregular data
AU - Hong, Wei
AU - Neophytou, Neophytos
AU - Mueller, Klaus
AU - Kaufman, Arie
N1 - Publisher Copyright:
© 2009 Springer-Verlag Berlin Heidelberg.
PY - 2009
Y1 - 2009
N2 - Volumetric datasets obtained from scientific simulation and partial differential equation solvers are typically given in the form of non-rectilinear grids. The splatting technique is a popular direct volume rendering algorithm, which can provide high quality rendering results, but has been mainly described for rectilinear grids. In splatting, each voxel is represented by a 3D kernel weighted by the discrete voxel value. While the 3D reconstruction kernels for rectilinear grids can be easily constructed based on the distance among the aligned voxels, for irregular grids the kernel construction is significantly more complicated. In this paper, we propose a novel method based on a 3D Delaunay triangulation to create 3D elliptical Gaussian kernels, which then can be used by a splatting algorithm for the rendering of irregular grids. Our method does not require a resampling of the irregular grid. Instead, we use a weighted least squares method to fit a 3D elliptical Gaussian centered at each grid point, approximating its Voronoi cell. The resulting 3D elliptical Gaussians are represented using a convenient matrix representation, which allows them to be seamlessly incorporated into our elliptical splatting rendering system.
AB - Volumetric datasets obtained from scientific simulation and partial differential equation solvers are typically given in the form of non-rectilinear grids. The splatting technique is a popular direct volume rendering algorithm, which can provide high quality rendering results, but has been mainly described for rectilinear grids. In splatting, each voxel is represented by a 3D kernel weighted by the discrete voxel value. While the 3D reconstruction kernels for rectilinear grids can be easily constructed based on the distance among the aligned voxels, for irregular grids the kernel construction is significantly more complicated. In this paper, we propose a novel method based on a 3D Delaunay triangulation to create 3D elliptical Gaussian kernels, which then can be used by a splatting algorithm for the rendering of irregular grids. Our method does not require a resampling of the irregular grid. Instead, we use a weighted least squares method to fit a 3D elliptical Gaussian centered at each grid point, approximating its Voronoi cell. The resulting 3D elliptical Gaussians are represented using a convenient matrix representation, which allows them to be seamlessly incorporated into our elliptical splatting rendering system.
UR - https://www.scopus.com/pages/publications/85032937046
U2 - 10.1007/b106657_11
DO - 10.1007/b106657_11
M3 - Conference contribution
AN - SCOPUS:85032937046
SN - 9783319912738
SN - 9783540250326
SN - 9783540250760
SN - 9783540250760
SN - 9783540332749
SN - 9783540886051
SN - 9783642150135
SN - 9783642216077
SN - 9783642231742
SN - 9783642273421
SN - 9783642341403
SN - 9783642543005
T3 - Mathematics and Visualization
SP - 213
EP - 225
BT - Mathematics and Visualization
A2 - Moller, Torsten
A2 - Russell, Robert D.
A2 - Hamann, Bernd
PB - Springer Heidelberg
T2 - Workshop on Mathematical Foundations of Scientific Visualization, Computer Graphics, and Massive Data Exploration, 2004
Y2 - 22 May 2004 through 27 May 2004
ER -