High-Quality, Semi-Analytical Volume Rendering for AMR Data

Marchesin, Stéphane; Verdiere, Guillaume Colin de

doi:10.1109/tvcg.2009.149

Cited by 18 publications

(14 citation statements)

References 16 publications

Supporting

Mentioning

Contrasting

Unclassified

Order By: Relevance

“…Alternatively, our approach directly takes geodesic grids as input, performs mesh traversal without constructing full 3D connectivity information, and thus can significantly reduce memory footprint and improve computing efficiency. Similar to Marchesin et al [MdV09], we also develop an analytic solution to compute ray integral within grid cells and generate high-quality rendering of geodesic grid data.…”

Section: Ray-casting Frameworkmentioning

confidence: 99%

See 1 more Smart Citation

Interactive Ray Casting of Geodesic Grids

Xie

2013

Computer Graphics Forum

View full text Add to dashboard Cite

Geodesic grids are commonly used to model the surface of a sphere and are widely applied in numerical simulations of geoscience applications. These applications range from biodiversity, to climate change and to ocean circulation. Direct volume rendering of scalar fields defined on a geodesic grid facilitates scientists in visually understanding their large scale data. Previous solutions requiring to first transform the geodesic grid into another grid structure (e.g., hexahedral or tetrahedral grid) for using graphics hardware are not acceptable for large data, because such approaches incur significant computing and storage overhead. In this paper, we present a new method for efficient ray casting of geodesic girds by leveraging the power of Graphics Processing Units (GPUs). A geodesic grid can be directly fetched from storage or streamed from simulations to the rendering stage without the need of any intermediate grid transformation. We have designed and implemented a new analytic scheme to efficiently perform value interpolation for ray integration and gradient calculations for lighting. This scheme offers a more cost-effective rendering solution over the existing direct rendering approach. We demonstrate the effectiveness of our rendering solution using real-world geoscience data.

show abstract

Section: Ray-casting Frameworkmentioning

confidence: 99%

“…We can split a ray within a frustum by the ray entry point, local minimum point, and the ray exit point, to obtain a set of monotonic intervals. For each interval, we use piecewise linear approximation for integration [MdV09]. In this way we can cover the entire interval of scalar value and capture all small structures.…”

Section: Sampling and Integrationmentioning

confidence: 99%

Interactive Ray Casting of Geodesic Grids

Xie

2013

Computer Graphics Forum

View full text Add to dashboard Cite

show abstract

“…Although these methods can be used to reduce sampling points, it is difficult for them to exactly grasp the variable variation and thus avoid rendering artifacts. To overcome the problem, Marchesin and Verdière (2009) proposed a GPU-based cell-projection volume rendering algorithm with adaptive sampling, and their sampling method can effectively grasp all monotony intervals of the rendered variable. To deal with TB-scale time-varying data output in large-scale scientific simulations, it is indispensable to develop parallel rendering algorithms in distributed-memory environments (Ma et al 1994).…”

Section: Related Workmentioning

confidence: 99%

A parallel preintegration volume rendering algorithm based on adaptive sampling

Wang

Cao

et al. 2016

J Vis

View full text Add to dashboard Cite

A parallel preintegration volume rendering algorithm based on adaptive sampling is proposed in this paper to visualize large-scale scientific data effectively on distributed-memory parallel computers. The algorithm sets sampling points adaptively by detecting the extremal points of a data field along the rays, so it can grasp the data variation exactly. After the data field is sampled distributedly on CPU cores, the resulting sampling points are sorted by piecewise packing orderly sampling points and then composited along each ray using the preintegration technique. In the algorithm, a static load balancing scheme based on information entropy is also proposed to balance the loads of both data reading and ray sampling. In addition, a mixed logarithmic quantization scheme is suggested to quantize depth distance so as to shorten the preintegration table while preserving the rendering quality. It is demonstrated that the presented algorithm can show inner features in a data field clearly and achieve a rendering speedup ratio between 1.8 and 4.4, compared with the traditional parallel volume rendering algorithm.

show abstract

“…To compute the relative position t where the maximum specular value is reached, we can use the derivative of the cubic form, which is a quadratic form, and solve the corresponding equation of second degree. Note that a similar technique has been used in [9] in order to find out the maximal shading value of an analytical form. Then, we can check whether the solution t is in [0, 1] or not, and compute the value of the corresponding specular term on t .…”

Section: Specular Termmentioning

confidence: 99%

Pre-Integrated Volume Rendering with Non-Linear Gradient Interpolation

Guetat

Ancel

Marchesin

et al. 2010

IEEE Trans. Visual. Comput. Graphics

View full text Add to dashboard Cite

Abstract-Shading is an important feature for the comprehension of volume datasets, but is difficult to implement accurately. Current techniques based on pre-integrated direct volume rendering approximate the volume rendering integral by ignoring non-linear gradient variations between front and back samples, which might result in cumulated shading errors when gradient variations are important and / or when the illumination function features high frequencies. In this paper, we explore a simple approach for pre-integrated volume rendering with non-linear gradient interpolation between front and back samples. We consider that the gradient smoothly varies along a quadratic curve instead of a segment in-between consecutive samples. This not only allows us to compute more accurate shaded pre-integrated look-up tables, but also allows us to more efficiently process shading amplifying effects, based on gradient filtering. An interesting property is that the pre-integration tables we use remain two-dimensional as for usual pre-integrated classification. We conduct experiments using a full hardware approach with the Blinn-Phong illumination model as well as with a non-photorealistic illumination model.

show abstract

High-Quality, Semi-Analytical Volume Rendering for AMR Data

Cited by 18 publications

References 16 publications

Interactive Ray Casting of Geodesic Grids

Interactive Ray Casting of Geodesic Grids

A parallel preintegration volume rendering algorithm based on adaptive sampling

Pre-Integrated Volume Rendering with Non-Linear Gradient Interpolation

Contact Info

Product

Resources

About