Friday, May 11, 2007
Classification for Fourier Volume Rendering
Pacific Graphics 2004
In the last decade, Fourier Volume Rendering (FVR) has obtained considerable attention due to its O(N^2 logN) rendering complexity, where O(N^3) is the volume size. Although ordinary volume rendering has O(N^3) rendering complexity, it is still preferred over FVR for the main reason, that FVR offers bad localization of spacial structures. As a consequence, it was assumed, that it is hardly possible to apply 1D transfer functions, which arbitrarily modify voxel values not only in dependence of the position, but also the voxel value. We show that this assumption is not true for threshold operators. Based on the theory of Fourier series, we derive a FVR method, which is capable of integrating all sample points greater (or alternatively, lower) than an iso-value τ during rendering, where τ can be modified interactively during the rendering session. We compare our method with other approaches and we show examples on well-known datasets to illustrate the quality of the renderings.
Subscribe to Posts [Atom]