A great challenge in the volume-rendering field is to achieve high-quality images in an acceptable amount of time. In the area of volume rendering, there is always a trade-off between speed and quality. Applications where only high-quality images are acceptable often use the ray-casting algorithm, but this method is computationally expensive and typically achieves low frame rates. The work presented here is RZSweep, a new volume-rendering algorithm for uniform rectilinear datasets, that gives high-quality images in a reasonable amount of time. In this algorithm a plane sweeps the vertices of the implicit grid of regular datasets in depth order, projecting all the implicit faces incident on each vertex. This algorithm uses the inherent properties of a rectilinear datasets. RZSweep is an object-order, back-toront, direct volume rendering, face projection algorithm for rectilinear datasets using the cell approach. It is a single processor serial algorithm. The simplicity of the algorithm allows the use of the graphics pipeline for hardware-assisted projection, and also, with minimum modification, a version of the algorithm that is graphics-hardware independent. Lighting, color and various opacity transfer functions are implemented for giving realism to the final resulting images. Finally, an image comparison is done between RZSweep and a 3D texture-based method for volume rendering using standard image metrics like Euclidian and geometric differences.

GPU-based raycasting is the state-of-the-art rendering technique for interactive volume visualization. The ray traversal is usually implemented in a fragment shader, utilizing the hardware in a way that was not originally intended. New programming interfaces for stream processing, such as CUDA, support a more general programming model and the use of additional device features, which are not accessible through traditional shader programming. In this paper we propose a slab-based raycasting technique that is modeled specifically to use these features to accelerate volume rendering. This technique is based on experience gained from comparing fragment shader implementations of basic raycasting to implementations directly translated to CUDA kernels. The comparison covers direct volume rendering with a variety of optional features, e.g., gradient and lighting calculations. Our findings are supported by benchmarks of typical volume visualization scenarios. We conclude that new stream processing models can only gain a small performance advantage when directly porting the basic raycasting algorithm. However, they can be advantageous through novel acceleration methods which use the hardware features not available to shader implementations.

Outlined is a new approach to the problem of surfacing particle-based fluid simulations. The key idea is to construct a surface that is as smooth as possible while remaining faithful to the particle locations. We describe a mesh-based algorithm that expresses the surface in terms of a constrained optimization problem. Our algorithm incorporates a secondary contribution in Marching Tiles, a generalization of the Marching Cubes isosurfacing algorithm. Marching Tiles provides guarantees on the minimum vertex valence, making the surface mesh more amenable to numerical operators such as the Bilaplacian.

Outlined is a new approach to the problem of surfacing particle-based fluid simulations. The key idea is to construct a surface that is as smooth as possible while remaining faithful to the particle locations. We describe a mesh-based algorithm that expresses the surface in terms of a constrained optimization problem. Our algorithm incorporates a secondary contribution in Marching Tiles, a generalization of the Marching Cubes isosurfacing algorithm. Marching Tiles provides guarantees on the minimum vertex valence, making the surface mesh more amenable to numerical operators such as the Bilaplacian.

Outlined is a new approach to the problem of surfacing particle-based fluid simulations. The key idea is to construct a surface that is as smooth as possible while remaining faithful to the particle locations. We describe a mesh-based algorithm that expresses the surface in terms of a constrained optimization problem. Our algorithm incorporates a secondary contribution in Marching Tiles, a generalization of the Marching Cubes isosurfacing algorithm. Marching Tiles provides guarantees on the minimum vertex valence, making the surface mesh more amenable to numerical operators such as the Bilaplacian. / Science, Faculty of / Computer Science, Department of / Graduate

Computed Tomography (CT) is a medical imaging modality which acquires anatomical data via the unique x-ray attenuation of materials. Yet, some clinically important materials remain difficult to distinguish with current CT technology. Spectral CT is an emerging technology which acquires multiple CT datasets for specific x-ray spectra. These spectra provide a fingerprint that allow materials to be distinguished that would otherwise look the same on conventional CT. The unique characteristics of spectral CT data motivates research into novel visualization techniques. In this thesis, we aim to provide the foundation for visualizing spectral CT data. Our initial investigation of similar multi-variate data types identified intermixing as a promising visualization technique. This promoted the development of a generic, modular and extensible intermixing framework. Therefore, the contribution of our work is a framework supporting the construction, analysis and storage of algorithms for visualizing spectral CT studies. To allow evaluation, we implemented the intermixing framework in an application called MARSCTExplorer along with a standard set of volume visualization tools. These tools provide user-interaction as well as supporting traditional visualization techniques for comparison. We evaluated our work with four spectral CT studies containing materials indistinguishable by conventional CT. Our results confirm that spectral CT can distinguish these materials, and reveal how these materials might be visualized with our intermixing framework.

The rapid proliferation of 3D volume data, including MRI and CT scans, is prompting the search within computer graphics for more effective volume visualisation techniques. Partially because of the traditional association with medical subjects, concepts borrowed from the domain of scientific illustration show great promise for enriching volume visualisation. This thesis describes the first general system dedicated to creating user-directed, variable-detail, scientific illustrations directly from volume data. In particular, using volume segmentation for explicit abstraction in non-photorealistic volume renderings is a new concept. The unique challenges and opportunities of volume data require rethinking many non-photorealistic algorithms that traditionally operate on polygonal meshes. The resulting 2D images are qualitatively different from but complementary to those normally seen in computer graphics, and inspire an analysis of the various artistic implications of volume models for scientific illustration.

Modern medical imaging devices are able to generate highly detailed three-dimensional (3D) images of the skeleton. Computerized image processing and analysis methods, combined with real-time volume visualization techniques, can greatly facilitate the interpretation of such images and are increasingly used in surgical planning to aid reconstruction of the skeleton after trauma or disease. Two key challenges are to accurately separate (segment) bone structures or cavities of interest from the rest of the image and to interact with the 3D data in an efficient way. This thesis presents efficient and precise interactive methods for segmenting, visualizing, and analysing 3D computed tomography (CT) images of the skeleton. The methods are validated on real CT datasets and are primarily intended to support planning and evaluation of cranio-maxillofacial (CMF) and orthopedic surgery. Two interactive methods for segmenting the orbit (eye-socket) are introduced. The first method implements a deformable model that is guided and fitted to the orbit via haptic 3D interaction, whereas the second method implements a user-steered volumetric brush that uses distance and gradient information to find exact object boundaries. The thesis also presents a semi-automatic method for measuring 3D angulation changes in wrist fractures. The fractured bone is extracted with interactive mesh segmentation, and the angulation is determined with a technique based on surface registration and RANSAC. Lastly, the thesis presents an interactive and intuitive tool for segmenting individual bones and bone fragments. This type of segmentation is essential for virtual surgery planning, but takes several hours to perform with conventional manual methods. The presented tool combines GPU-accelerated random walks segmentation with direct volume rendering and interactive 3D texture painting to enable quick marking and separation of bone structures. It enables the user to produce an accurate segmentation within a few minutes, thereby removing a major bottleneck in the planning procedure.

<p>Ultrasound (US) volume data is noisy, so traditional methods for direct volume rendering (DVR) are less appropriate. Improved methods or new techniques are required. There are furthermore a high performance requirement and limited pre-processing to be considered in order for it to be used interactively, since the volume data might be time-varying.</p><p>There exist numerous techniques for improving visual perception of volume rendering, and while some perform well and produce a visually enhanced result, many are designed and compared for use with medical data that has a high signal-to-noise ratio. This master thesis describe and compare recent methods for DVR illumination, in the form of ambient occlusion or direct/indirect lighting from an external light source. New designs and modifications are introduced for efficiently and effectively enhancing the visual quality of DVR with US data. Furthermore, this thesis addresses the issue of how clipping is performed during rendering and for the different illumination techniques, which is commonly used in ultrasound visualization.</p><p>This diploma work was conducted at Siemens Corporate Research in Princeton, NJ where the partially open source framework XIP is developed. The framework was extended further to include modern methods for DVR illumination that are described in detail within this thesis. Finally, presented results show that several methods can be used to visually enhance the visualization within highly interactive frame-rates.</p>

<p>As the volumes are entering the world of computer graphics the pure volume visualisation becomes a more important tool in for example research and medical applications. But the advance in haptics --- force feedback from the computer --- is behind. In volume haptics no equal to the proxy method so popular in surface haptics has yet emerged. Some implementations of volume haptics even use surfaces as intermediate representations so that surface haptics can be used.</p><p>The intention of this work was to create natural feeling haptic feedback from volumetric density data using pure volume haptics. The haptic algorithm would be implemented in Reachin API for the Reachin Desktop Display, together with other parts to build up a usable volume visualisation environment.</p><p>To achieve the feeling of stiffness and friction dependent on tissue type, a proxy based method was developed. In the volume the proxy is constrained by virtual surfaces defined by the local gradient. This algorithm was implemented in a volume haptics node and for visualisation a volume renderer node was implemented. These nodes can be used to setup different volume visualisation environments using VRML.</p>