Michael Meißner

Learn More
This paper evaluates and compares four volume rendering algorithms that have become rather popular for rendering datasets described on uniform rectilinear grids: raycasting, splatting, shear-warp, and hardware-assisted 3D texture-mapping. In order to assess both the strengths and the weaknesses of these algorithms in a wide variety of scenarios, a set of(More)
For interactive rendering of large polygonal objects, fast visibility queries are necessary to quickly decide whether polygonal objects are visible and need to be rendered. None of the numerous published algorithms provide visibility performance for interactive rendering of large models. In this paper, we propose an OpenGL extension for fast occlu-sion(More)
The decision to use either the Direct Volume Rendering paradigm or the Indirect Volume Rendering paradigm to visualize a volume dataset is a topical question in Volume Graphics. Unfortunately, it seems that this question has not been sufficiently addressed so far and is not easy to answer. In this paper, we discuss some of the advantages and disadvantages(More)
In this paper we present a novel hybrid CPU-GPU approach for rendering curvilinear grids. Visibility sorting is accomplished by parallel peeling cells off the grid, utilizing an active cell peeling front. In each step, we compute the ray-cell intersection coordinates on the GPU, perform accurate volume integration (CPU), and determine the set of active(More)
We present a new technique which enables direct volume rendering based on 3D texture mapping hardware, enabling shading as well as classification of the interpolated data. Our technique supports accurate lighting for a one directional light source, semi-transparent classification, and correct blending. To circumvent the limitations of one general(More)
We present an OpenGL-assisted visibility culling algorithm to improve the rendering performance of large polygonal models. Using a combination of hierarchical model-space partitioning, OpenGL-assisted view-frustum culling, and OpenGL-assisted oc-clusion culling, we achieve a significantly better performance on general polygonal models than previous(More)
Volume rendering has great potential for parallelization due to the tremendous number of computations necessary. Besides the enormous computational power needed, the memory interface is usually of crucial importance and frequently the bottleneck.This paper presents an implementation of a parallel ray casting algorithm for orthogonal projections on a new(More)
Shading and classification are among the most powerful and important techniques used in volume rendering. Unfortunately, for hardware accelerated volume rendering based on OpenGL, direct classification was previously only supported on SGI platforms and shading could only be approximated inaccurately, resulting in artifacts mostly visible in darkening. In(More)
This paper presents a reconfigurable, hardware accelerated, volume rendering system for high quality perspective ray casting. The volume rendering accelerator performs ray casting by calculating the path of the ray through the volume using a programmable Xilinx Virtex FPGA which provides fast design changes and low cost development. Volume datasets are(More)
Efficient handling of large polygonal scenes has always been a challenging task. In recent years, view-frustum and occlusion culling have drawn a lot of attention for reducing the complexity of those scenes. The problem of how to efficiently organize such scenes for fast image synthesis is widely neglected, although the answer heavily affects the overall(More)