Volume visualization of sparse irregular meshes

Giertsen, Christopher

doi:10.1109/38.124287

Cited by 58 publications

(35 citation statements)

References 8 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…However, a correct depth-ordering of cells does not always exist, and great care must be taken to avoid visual artifacts [50]. Finally, another class of algorithms uses a sweepplane through the volume followed by rendering of 2D cells [15,43].…”

Section: Previous Workmentioning

confidence: 99%

Volume MLS Ray Casting

Ledergerber

Guennebaud

Meyer

et al. 2008

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

Abstract-The method of Moving Least Squares (MLS) is a popular framework for reconstructing continuous functions from scattered data due to its rich mathematical properties and well-understood theoretical foundations. This paper applies MLS to volume rendering, providing a unified mathematical framework for ray casting of scalar data stored over regular as well as irregular grids. We use the MLS reconstruction to render smooth isosurfaces and to compute accurate derivatives for high-quality shading effects. We also present a novel, adaptive preintegration scheme to improve the efficiency of the ray casting algorithm by reducing the overall number of function evaluations, and an efficient implementation of our framework exploiting modern graphics hardware. The resulting system enables high-quality volume integration and shaded isosurface rendering for regular and irregular volume data.

show abstract

Section: Previous Workmentioning

confidence: 99%

Volume MLS Ray Casting

Ledergerber

Guennebaud

Meyer

et al. 2008

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

show abstract

“…In the following, we only focus on those techniques which have been directly linked to the sweeping paradigm. Giertsen applied the sweeping paradigm to allow a volumetric visualization of sparse irregular grids [7]. Thus, he was able to transfer the static 3D ray-casting problem into a dynamic 2D cell sorting problem, which allows efficient rendering.…”

Section: Related Workmentioning

confidence: 99%

Image Plane Sweep Volume Illumination

Sundén

Ynnerman

Ropinski

2011

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

Fig. 1. A CT scan of a penguin (512 × 512 × 1146 voxels) rendered using image plane sweep volume illumination. Local and global illumination effects are integrated, yielding in high quality visualizations of opaque as well as transparent materials.Abstract-In recent years, many volumetric illumination models have been proposed, which have the potential to simulate advanced lighting effects and thus support improved image comprehension. Although volume ray-casting is widely accepted as the volume rendering technique which achieves the highest image quality, so far no volumetric illumination algorithm has been designed to be directly incorporated into the ray-casting process. In this paper we propose image plane sweep volume illumination (IPSVI), which allows the integration of advanced illumination effects into a GPU-based volume ray-caster by exploiting the plane sweep paradigm. Thus, we are able to reduce the problem complexity and achieve interactive frame rates, while supporting scattering as well as shadowing. Since all illumination computations are performed directly within a single rendering pass, IPSVI does not require any preprocessing nor does it need to store intermediate results within an illumination volume. It therefore has a significantly lower memory footprint than other techniques. This makes IPSVI directly applicable to large data sets. Furthermore, the integration into a GPU-based ray-caster allows for high image quality as well as improved rendering performance by exploiting early ray termination. This paper discusses the theory behind IPSVI, describes its implementation, demonstrates its visual results and provides performance measurements.

show abstract

“…For each ray, exterior faces are tested to find the first intersection point, and subsequent intersection points can be efficiently calculated by using the connectivity between elements. Giertsen [6] proposes a different ray-tracing approach by slicing the data along each horizontal scanline. The intersection of the slicing plane and the data elements results in a set of planar polygons, which are triangulated.…”

Section: Visualization On Unstructured Gridsmentioning

confidence: 99%

Parallel volume ray-casting for unstructured-grid data on distributed-memory architectures

1995

Proceedings of the IEEE Symposium on Parallel Rendering - PRS '95

View full text Add to dashboard Cite

Volume visualization of sparse irregular meshes

Cited by 58 publications

References 8 publications

Volume MLS Ray Casting

Volume MLS Ray Casting

Image Plane Sweep Volume Illumination

Parallel volume ray-casting for unstructured-grid data on distributed-memory architectures

Contact Info

Product

Resources

About