VisSym03: Joint Eurographics - IEEE TCVG Symposium on Visualization
Permanent URI for this collection
Using Graphs for Fast Error Term Approximation of Time-varying Datasets
[meta data] [files:
Nuber, C.
;
LaMar, E. C.
;
Pascucci, V.
;
Hamann, B.
;
Joy, K. I.
Visual Hierarchical Dimension Reduction for Exploration of High Dimensional Datasets
[meta data] [files:
Yang, J.
;
Ward, M.O.
;
Rundensteiner, E.A.
;
Huang, S.
Visualizing Spatial Distribution Data Sets
[meta data] [files:
Luo, Alison
;
Kao, David
;
Pang, Alex
Path Seeds and Flexible Isosurfaces Using Topology for Exploratory Visualization
[meta data] [files:
Carr, Hamish
;
Snoeyink, Jack
Accelerated Force Computation for Physics-Based Information Visualization
[meta data] [files:
Hao, Ming C.
;
Dayal, Umeshwar
;
Cotting, Daniel
;
Holenstein, Thomas
;
Gross, Markus
Isosurfaces on Optimal Regular Samples
[meta data] [files:
Carr, Hamish
;
Theußl, Thomas
;
Möller, Torsten
Shrouds: Optimal Separating Surfaces for Enumerated Volumes
[meta data] [files:
Nielson, Gregory M.
;
Graf, Gary
;
Holmes, Ryan
;
Huang, Adam
;
Phielipp, Mariano
Detection of constrictions on closed polyhedral surfaces
[meta data] [files:
Hétroy, F.
;
Attali, D.
Detecting Critical Regions in Scalar Fields
[meta data] [files:
Weber, Gunther H.
;
Scheuermann, Gerik
;
Hamann, Bernd
Analysis of the HDAF for Interpolation and Noise Suppression in Volume Rendering
[meta data] [files:
Andersson, Kristoffer
;
Kakadiaris, Ioannis A.
;
Papadakis, Manos
;
Kouri, Donald J.
;
Hoffman, David K.
ShellSplatting: Interactive Rendering of Anisotropic Volumes
[meta data] [files:
Botha, Charl P.
;
Post, Frits H.
Case Study: Comparing Two Methods for Filtering External Motion in 4D Confocal Microscopy Data
[meta data] [files:
Leeuw, Wim de
;
Liere, Robert van
Case Study: Cellar Scaffold Extraction Using Crest Point for Volume Rendering
[meta data] [files:
Hu, Jiuxiang
;
Baluch, Page D.
;
Razdan, Anshuman
;
Nielson, Gregory M.
;
Farin, Gerald E.
;
Capco, David G.
MCMR: A Fluid View on Time Dependent Volume Data
[meta data] [files:
Leeuw, Wim de
;
Liere, Robert van
Efficient Visualization of Large Medical Image Datasets on Standard PC Hardware
[meta data] [files:
Pekar, V.
;
Hempel, D.
;
Kiefer, G.
;
Busch, M.
;
Weese, J.
Contouring Curved Quadratic Elements
[meta data] [files:
Wiley, D. F.
;
Childs, H. R.
;
Gregorski, B. F.
;
Hamann, B.
;
Joy, K. I.
Adaptive Smooth Scattered-data Approximation for Large-scale Terrain Visualization
[meta data] [files:
Bertram, Martin
;
Tricoche, Xavier
;
Hagen, Hans
A Robust Level-Set Algorithm for Centerline Extraction
[meta data] [files:
Telea, Alexandru
;
Vilanova, Anna
Improving Topological Segmentation of Three-dimensional Vector Fields
[meta data] [files:
Mahrous, Karim M.
;
Bennett, Janine C.
;
Hamann, Bernd
;
Joy, Kenneth I.
Vector Field Visualization using Markov Random Field Texture Synthesis
[meta data] [files:
Taponecco, Francesca
;
Alexa, Marc
Interactive Feature Specification for Focus+Context Visualization of Complex Simulation Data
[meta data] [files:
Doleisch, Helmut
;
Gasser, Martin
;
Hauser, Helwig
Rendering Vector Data over Global, Multi-resolution 3D Terrain
[meta data] [files:
Wartell, Zachary
;
Kang, Eunjung
;
Wasilewski, Tony
;
Ribarsky, William
;
Faust, Nickolas
Smart Hardware-Accelerated Volume Rendering
[meta data] [files:
Roettger1, Stefan
;
Guthe, Stefan
;
Weiskopf, Daniel
;
Ertl, Thomas
;
Strasser, Wolfgang
Hardware-assisted View-dependent Isosurface Extraction using Spherical Partition
[meta data] [files:
Gao, Jinzhu
;
Shen, Han-Wei
Hierarchical Isosurface Segmentation Based on Discrete Curvature
[meta data] [files:
Vivodtzev, Fabien
;
Linsen, Lars
;
Bonneau, Georges-Pierre
;
Hamann, Bernd
;
Joy, Kenneth I.
;
Olshausen, Bruno A.
ISOSLIDER: A System for Interactive Exploration of Isosurfaces
[meta data] [files:
Chhugani, Jatin
;
Vishwanath, Sudhir
;
Cohen, Jonathan
;
Kumar, Subodh
Browse
Recent Submissions
Item Using Graphs for Fast Error Term Approximation of Time-varying Datasets(The Eurographics Association, 2003) Nuber, C.; LaMar, E. C.; Pascucci, V.; Hamann, B.; Joy, K. I.; G.-P. Bonneau and S. Hahmann and C. D. HansenWe present a method for the efficient computation and storage of approximations of error tables used for error estimation of a region between different time steps in time-varying datasets. The error between two time steps is defined as the distance between the data of these time steps. Error tables are used to look up the error between different time steps of a time-varying dataset, especially when run time error computation is expensive. However, even the generation of error tables itself can be expensive. For n time steps, the exact error look-up table (which stores the error values for all pairs of time steps in a matrix) has a memory complexity and pre-processing time complexity of O(n2), and O(1) for error retrieval. Our approximate error look-up table approach uses trees, where the leaf nodes represent original time steps, and interior nodes contain an average (or best-representative) of the children nodes. The error computed on an edge of a tree describes the distance between the two nodes on that edge. Evaluating the error between two different time steps requires traversing a path between the two leaf nodes, and accumulating the errors on the traversed edges. For n time steps, this scheme has a memory complexity and pre-processing time complexity of O(nlog(n)), a significant improvement over the exact scheme; the error retrieval complexity is O(log(n)). As we do not need to calculate all possible n2 error terms, our approach is a fast way to generate the approximation.Item Visual Hierarchical Dimension Reduction for Exploration of High Dimensional Datasets(The Eurographics Association, 2003) Yang, J.; Ward, M.O.; Rundensteiner, E.A.; Huang, S.; G.-P. Bonneau and S. Hahmann and C. D. HansenTraditional visualization techniques for multidimensional data sets, such as parallel coordinates, glyphs, and scatterplot matrices, do not scale well to high numbers of dimensions. A common approach to solving this problem is dimensionality reduction. Existing dimensionality reduction techniques usually generate lower dimensional spaces that have little intuitive meaning to users and allow little user interaction. In this paper we propose a new approach to handling high dimensional data, named Visual Hierarchical Dimension Reduction (VHDR), that addresses these drawbacks. VHDR not only generates lower dimensional spaces that are meaningful to users, but also allows user interactions in most steps of the process. In VHDR, dimensions are grouped into a hierarchy, and lower dimensional spaces are constructed using clusters of the hierarchy. We have implemented the VHDR approach into XmdvTool, and extended several traditional multidimensional visualization methods to convey dimension cluster characteristics when visualizing the data set in lower dimensional spaces. Our case study of applying VHDR to a real data set supports our belief that this approach is effective in supporting the exploration of high dimensional data sets.Item Visualizing Spatial Distribution Data Sets(The Eurographics Association, 2003) Luo, Alison; Kao, David; Pang, Alex; G.-P. Bonneau and S. Hahmann and C. D. HansenIn this paper, we define distributions as a new data type and address the challenges of visualizing spatial distribution data sets. Numerous visualization techniques exist today for dealing with scalar data. That is, there is a scalar value at each spatial location, which may also be changing over time. Likewise, techniques exist for dealing with vector, tensor and multivariate data sets. However, there is currently no systematic way of dealing with distribution data where there is a collection of values for the same variable at every location and time. Distribution data is increasingly becoming more common as computers and sensor technologies continue to improve. They have also been used in a number of fields ranging from agriculture, engineering design and manufacturing to weather forecasting. Rather than developing specialized visualization techniques for dealing with distribution data, the approach presented in this paper is to find a systematic way of extending existing visualization methods to handle this new data type. For example, we would like to be able to generate isosurfaces of 3D scalar distribution data sets, or generate streamlines of vector distribution data sets. In order to accomplish this goal, we propose the use of a set of mathematically and procedurally defined operators that allow us to work directly on distributions. Color images can also be found in www.cse.ucsc.edu/research/avis/operator.html.Item Path Seeds and Flexible Isosurfaces Using Topology for Exploratory Visualization(The Eurographics Association, 2003) Carr, Hamish; Snoeyink, Jack; G.-P. Bonneau and S. Hahmann and C. D. HansenMorse theory and the Reeb graph give topological summaries of the behaviour of continuous scalar functions. The contour tree augments the Reeb graph for the isosurfaces in a volume to store seed sets, which are starting points for extracting isosurfaces by the continuation method. We replace the minimal seed sets of van Kreveld et al. with path seeds, which generate paths that correspond directly to the individual components of an isosurface. From a path we get exactly one seed per component, which reduces storage and simplifies isosurface extraction. Moreover, the correspondence allows us to extend the contour spectrum of Bajaj et al. to an interface that we call flexible isosurfaces, in which individual contours with different isovalues can be displayed, manipulated and annotated. The largest contour segmentation, in which separate surfaces are generated for each local maximum of the field, is a special case of the flexible isosurface.Item Accelerated Force Computation for Physics-Based Information Visualization(The Eurographics Association, 2003) Hao, Ming C.; Dayal, Umeshwar; Cotting, Daniel; Holenstein, Thomas; Gross, Markus; G.-P. Bonneau and S. Hahmann and C. D. HansenVisualization of similarity is an emerging technique for analyzing relation-based data sets. A common way of computing the respective layouts in an information space is to employ a physics-based mass-spring system. Force computation, however, is costly and of order N2. In this paper, we propose a new acceleration method to adopt a well-known optimized force-computation algorithm which drastically reduces the computation time to the order of N log N. The basic idea is to derive a two-pass, "prediction and correction" procedure including a customized potential function. We have applied this method to two different applications: web access and sales analysis. Both demonstrate the efficiency and versatility of the presented method.Item Isosurfaces on Optimal Regular Samples(The Eurographics Association, 2003) Carr, Hamish; Theußl, Thomas; Möller, Torsten; G.-P. Bonneau and S. Hahmann and C. D. HansenVolumetric samples on Cartesian lattices are less efficient than samples on body-centred cubic (BCC) lattices. We show how to construct isosurfaces on BCC lattices using several different algorithms. Since the mesh that arises from BCC lattices involves a large number of cells, we show two alternate methods of reducing the number of cells by clumping tetrahedra into either octahedra or hexahedra. We also propose a theoretical model for estimating triangle counts for various algorithms, and present experimental results to show that isosurfaces generated using one of our algorithms can be competitive with isosurfaces generated using Marching Cubes on similar Cartesian gridsItem Shrouds: Optimal Separating Surfaces for Enumerated Volumes(The Eurographics Association, 2003) Nielson, Gregory M.; Graf, Gary; Holmes, Ryan; Huang, Adam; Phielipp, Mariano; G.-P. Bonneau and S. Hahmann and C. D. HansenWe describe new techniques for computing a smooth triangular mesh surface that surrounds an enumerated volume consisting of a collection of points from a 3D rectilinear grid. The surface has the topology of an isosurface computed by a marching cubes method applied to a field function that has the value one at the points in the volume and zero for points not in the volume. The vertices are confined to the edges of the grid that penetrate this separating surface and the precise positions are computed so as to optimize a certain energy functional applied to the surface. We use efficient iterative methods to compute the optimal separating surfaces. We lift the concept of energy functionals for planar curves to isosurfaces by means of the 4*-network which is a unique collection of orthogonal planar polygons lying on the isosurface. The general strategy that we describe here leads to methods that are simple, efficient, and effective.Item Detection of constrictions on closed polyhedral surfaces(The Eurographics Association, 2003) Hétroy, F.; Attali, D.; G.-P. Bonneau and S. Hahmann and C. D. HansenWe define constrictions on a surface as simple closed geodesic curves, i.e. curves whose length is locally minimal. They can be of great interests in order to cut the surface in smaller parts. In this paper, we present a method to detect constrictions on closed triangulated surfaces. Our algorithm is based on a progressive approach. First, the surface is simplified by repeated edge collapses. The simplification continues until we detect an edge whose collapse would change the topology of the surface. It happens when three edges of the surface form a triangle that does not belong to the surface. The three edges define what we call a seed curve and are used to initialize the search of a constriction. Secondly, the constriction is progressively constructed by incrementally refining the simplified surface until the initial surface is retrieved. At each step of this refinement process, the constriction is updated. Some experimental results are provided.Item Detecting Critical Regions in Scalar Fields(The Eurographics Association, 2003) Weber, Gunther H.; Scheuermann, Gerik; Hamann, Bernd; G.-P. Bonneau and S. Hahmann and C. D. HansenTrivariate data is commonly visualized using isosurfaces or direct volume rendering. When exploring scalar fields by isosurface extraction it is often difficult to choose isovalues that convey "useful" information. The significance of visualizations using direct volume rendering depends on the choice of good transfer functions. Understanding and using isosurface topology can help in identifying "relevant" isovalues for visualization via isosurfaces and can be used to automatically generate transfer functions. Critical isovalues indicate changes in topology of an isosurface: the creation of new surface components, merging of surface components or the formation of holes in a surface component. Interesting isosurface behavior is likely to occur at and around critical isovalues. Current approaches to detect critical isovalues are usually limited to isolated critical points. Data sets often contain regions of constant value (i.e., mesh edges, mesh faces, or entire mesh cells). We present a method that detects critical points, critical regions and corresponding critical isovalues for a scalar field defined by piecewise trilinear interpolation over a uniform rectilinear grid. We describe how to use the resulting list of critical regions/points and associated values to examine trivariate data.Item Analysis of the HDAF for Interpolation and Noise Suppression in Volume Rendering(The Eurographics Association, 2003) Andersson, Kristoffer; Kakadiaris, Ioannis A.; Papadakis, Manos; Kouri, Donald J.; Hoffman, David K.; G.-P. Bonneau and S. Hahmann and C. D. HansenIn this paper, we evaluate the HDAF (Hermite Distributed Approximating Functionals) family of interpolation and derivative functions, with respect to their accuracy for reliable volume rendering, and compare them with other interpolation and derivative estimation filters. We utilize several different evaluation methods, both analytical and experimental. The former includes the order of decay of the global error, the local spatial error, and the behavior of the filters in the frequency domain. In the experimental part, visualizations of both synthetic and medical data are produced and studied. We show that the HDAFs exhibit superior behavior if the volumetric data are distorted by high frequency noise, and perform well under noise free conditions. This due to their ability to adjust the range of recovered frequencies.Item ShellSplatting: Interactive Rendering of Anisotropic Volumes(The Eurographics Association, 2003) Botha, Charl P.; Post, Frits H.; G.-P. Bonneau and S. Hahmann and C. D. HansenThis work presents an extension of shell rendering that is more flexible and yields higher quality volume renderings. Shell rendering consists of efficient data-structures and methods to manipulate and render structures with non-precise boundaries in volume data. We have updated these algorithms by creating an implementation that makes effective use of ubiquitously available commercial graphics hardware. More significantly, we have extended the algorithm to make use of elliptical Gaussian splats instead of straight-forward voxel projection. This dramatically increases the quality of the renderings, especially with anisotropically sampled volumes. The use of the graphics hardware alleviates the performance penalty of using splats.Item Anti-Aliased Volume Extraction(The Eurographics Association, 2003) Lakare, Sarang; Kaufman, Arie; G.-P. Bonneau and S. Hahmann and C. D. HansenWe present a technique to extract regions from a volumetric dataset without introducing any aliasing so that the extracted volume can be explored using direct volume rendering techniques. Extracting regions using binary masks generated by contemporary segmentation approaches typically introduces aliasing at the boundary of the extracted regions. This aliasing is especially visible when the dataset is visualized using direct volume rendering. Our algorithm uses the binary mask only to locate the boundary. The main idea of the algorithm is to retain the natural fuzziness at the boundary of a region even after it is extracted. To achieve that, intensities of the boundary voxels are flipped so that they are now representing a fuzzy boundary with the empty region surrounding it, while preserving the boundary position.Item Case Study: Comparing Two Methods for Filtering External Motion in 4D Confocal Microscopy Data(The Eurographics Association, 2003) Leeuw, Wim de; Liere, Robert van; G.-P. Bonneau and S. Hahmann and C. D. HansenIn this case study, we compare two methods for filtering external motion in time dependent volume data sets acquired from confocal microscopy. The pros and cons of a landmark based and a voxel based method are discussed. We show that filtering external motion is an essential first step for the visualization of confocal data.Item Case Study: Cellar Scaffold Extraction Using Crest Point for Volume Rendering(The Eurographics Association, 2003) Hu, Jiuxiang; Baluch, Page D.; Razdan, Anshuman; Nielson, Gregory M.; Farin, Gerald E.; Capco, David G.; G.-P. Bonneau and S. Hahmann and C. D. HansenExtraction of scaffolds, such as the meiotic spindles, a 3D tubular framework consisting of the microtubules, from conforcal laser scanning microscopy (CLSM) data of a cell is a challenge in biological image processing. It is of major importance in the research of microtubule anchor proteins, and molecular motor mechanics. However, the scaffold is hidden within CLSM data due to the nature of light excitation, and is difficult to visualize using traditional opacity and color transfer functions that depend only on local intensity. In this paper, we treat 3D CLSM data as a hyper-surface in R4, and show that the crest points of the hyper-surface correspond to the centerline of the hidden scaffold. We propose an automatic approach to extract the hidden scaffold from CLSM data. First, the spindle from the large data set is segmented using Weibull E-SD fields. We, next, apply the Savitzky-Golay (S-G) filter and Gaussian convolution to reduce the noise in the data and calculate the first and second derivatives. Lastly, direct volume rendering using ray casting is applied to visualize the volume data. We combine the local intensity and maximum curvature information to decide the opacity transfer function. Promising results are shown on simulated data sets as well as real CLSM data of mouse egg.Item MCMR: A Fluid View on Time Dependent Volume Data(The Eurographics Association, 2003) Leeuw, Wim de; Liere, Robert van; G.-P. Bonneau and S. Hahmann and C. D. HansenMass Conservative Motion Reconstruction is a new method for estimating motion in time dependent volume data. A time dependent vector field representing the movement of the data is computed from a sequence of scalar volume data sets. The principle of mass conservation in a continuum is used during the reconstruction. Standard flow visualization techniques are used for the visualization of the derived vector field. This paper presents the underlying concepts of MCMR, its implementation, its accuracy and applicability.Item Feature Flow Fields(The Eurographics Association, 2003) Theisel, H.; Seidel, H.-P.; G.-P. Bonneau and S. Hahmann and C. D. HansenFeature tracking algorithms for instationary vector fields are usually based on a correspondence analysis of the features at different time steps. This paper introduces a method for feature tracking which is based on the integration of stream lines of a certain vector field called feature flow field. We analyze for which features the method of feature flow fields can be applied, we show how events in the flow can be detected using feature flow fields, and we show how to construct the feature flow fields for particular classes of features. Finally, we apply the technique to track critical points in a 2D instationary vector field.Item Efficient Visualization of Large Medical Image Datasets on Standard PC Hardware(The Eurographics Association, 2003) Pekar, V.; Hempel, D.; Kiefer, G.; Busch, M.; Weese, J.; G.-P. Bonneau and S. Hahmann and C. D. HansenFast and accurate algorithms for medical image processing and visualization are becoming increasingly important due to routine acquisition and processing of rapidly growing amounts of data in clinical practice. At the same time, standard computer hardware is becoming sufficiently powerful to be used in applications which previously required expensive and inflexible special-purpose hardware. We present an efficient volume rendering approach using the example of maximum intensity projection (MIP), which is an important clinical tool. The method systematically exploits the properties of general-purpose hardware such as hierarchical cache memories and superscalar processing. In order to optimize the cache efficiency, the dataset is processed in blocks which fit into the processor cache. The innermost ray casting loop is transformed such that the arithmetic operations and memory accesses can be processed in parallel on current general-purpose processors. Combined with other optimization strategies, such as vectorization and block-wise ray skipping, this approach yields near-interactive frame rates for large clinical datasets using a standard dual-processor PC. Data compression and simplification methods have intentionally not been used in order to demonstrate the achievable performance without any quality reductions. Some of the presented ideas can be applied to other computationally intensive image processing tasks.Item Interaction of Light and Tensor Fields(The Eurographics Association, 2003) Zheng, Xiaoqiang; Pang, Alex; G.-P. Bonneau and S. Hahmann and C. D. HansenWe present three new ways of looking at tensor volumes. All three methods are based on the interaction of simulated light and the tensor field. Conceptually, rays are shot from a certain direction into the tensor volume. These rays are influenced by the surrounding tensor field and bent as they traverse through the volume. The tensor is visualized by both the nature of the bent rays and by the collection of rays deposited on a receiving plate. The former is similar to streamlines, but shows paths of greatest influence by the tensor field. The latter is similar to caustic effects from photon maps, but shows the convergence or divergence of the rays through the tensor volume. We also use the concept of treating the tensor volume as a special lens that distorts an image. Using backward ray tracing through the tensor volume, we generate image distortions that also show internal properties of the tensor field. A key advantage of these techniques is that they can work directly with non-symmetric tensor fields without first decomposing them into components. Color images can also be found in www.soe.ucsc.edu/research/avis/tensorray.html.Item Contouring Curved Quadratic Elements(The Eurographics Association, 2003) Wiley, D. F.; Childs, H. R.; Gregorski, B. F.; Hamann, B.; Joy, K. I.; G.-P. Bonneau and S. Hahmann and C. D. HansenWe show how to extract a contour line (or isosurface) from quadratic elements - specifically from quadratic triangles and tetrahedra. We also devise how to transform the resulting contour line (or surface) into a quartic curve (or surface) based on a curved-triangle (curved-tetrahedron) mapping. A contour in a bivariate quadratic function defined over a triangle in parameter space is a conic section and can be represented by a rational-quadratic function, while in physical space it is a rational quartic. An isosurface in the trivariate case is represented as a rational-quadratic patch in parameter space and a rational-quartic patch in physical space. The resulting contour surfaces can be rendered efficiently in hardware.Item Adaptive Smooth Scattered-data Approximation for Large-scale Terrain Visualization(The Eurographics Association, 2003) Bertram, Martin; Tricoche, Xavier; Hagen, Hans; G.-P. Bonneau and S. Hahmann and C. D. HansenWe present a fast method that adaptively approximates large-scale functional scattered data sets with hierarchical B-splines. The scheme is memory efficient, easy to implement and produces smooth surfaces. It combines adaptive clustering based on quadtrees with piecewise polynomial least squares approximations. The resulting surface components are locally approximated by a smooth B-spline surface obtained by knot removal. Residuals are computed with respect to this surface approximation, determining the clusters that need to be recursively refined, in order to satisfy a prescribed error bound. We provide numerical results for two terrain data sets, demonstrating that our algorithm works efficiently and accurate for large data sets with highly non-uniform sampling densities.Item A Robust Level-Set Algorithm for Centerline Extraction(The Eurographics Association, 2003) Telea, Alexandru; Vilanova, Anna; G.-P. Bonneau and S. Hahmann and C. D. HansenWe present a robust method for extracting 3D centerlines from volumetric datasets. We start from a 2D skeletonization method to locate voxels centered with respect to three orthogonal slicing directions. Next, we introduce a new detection criterion to extract the centerline voxels from the above skeletons, followed by a thinning, reconnection, and a ranking step. Overall, the proposed method produces centerlines that are object-centered, connected, one voxel thick, robust with respect to object noisiness, handles arbitrary object topologies, comes with a simple pruning threshold, and is fast to compute. We compare our results with two other methods on a variety of real-world datasetsItem Improving Topological Segmentation of Three-dimensional Vector Fields(The Eurographics Association, 2003) Mahrous, Karim M.; Bennett, Janine C.; Hamann, Bernd; Joy, Kenneth I.; G.-P. Bonneau and S. Hahmann and C. D. HansenWe present three enhancements to accelerate the extraction of separatrices of three-dimensional vector fields, using intelligently selected "sample" streamlines. These enhancements reduce the number of needed sample streamlines and their propagation length. Inflow/outflow matching supports the simultaneous extraction of topologically significant inflow and outflow separatrices in a single pass. An adaptive sampling approach is introduced and used to seed streamlines in a more meaningful and efficient manner. Cell-locking is a new concept that isolates regions of a data set that do not contain separatrices. This concept makes streamline propagation more efficient as streamlines are not propagated through cells that do not influence or contain separatrices. These enhancements enable us to perform separatrix construction for three-dimensional vector field data requiring less overall computation.Item Vector Field Visualization using Markov Random Field Texture Synthesis(The Eurographics Association, 2003) Taponecco, Francesca; Alexa, Marc; G.-P. Bonneau and S. Hahmann and C. D. HansenVector field visualization aims at generating images in order to convey the information existing in the data. We use Markov Random Field (MRF) texture synthesis methods to generate the visualization from a set of sample textures. MRF texture synthesis methods allow generating images that are locally similar to a given example image. We extend this idea for vector field visualization by identifying each vector value with a representative example image, e.g. a strongly directed texture that is rotated according to a 2D vector. The visualization is synthesized pixel by pixel, where each pixel is chosen from the sample texture according to the vector values of the local pixel. The visualization locally communicates the vector information as each pixel is chosen from a sample that is representative of the vector. Furthermore it is smooth, as MRF texture synthesis searches for best fitting neighborhoods. This leads to dense and smooth visualizations with the additional freedom to use arbitrary representation textures for any vector value.Item Interactive Feature Specification for Focus+Context Visualization of Complex Simulation Data(The Eurographics Association, 2003) Doleisch, Helmut; Gasser, Martin; Hauser, Helwig; G.-P. Bonneau and S. Hahmann and C. D. HansenVisualization of high-dimensional, large data sets, resulting from computational simulation, is one of the most challenging fields in scientific viualization. When visualization aims at supporting the analysis of such data sets, feature-based approches are very useful to reduce the amount of data which is shown at each instance of time and guide the user to the most interesting areas of the data. When using feature-based visualization, one of the most difficult questions is how to extract or specify the features. This is mostly done (semi-)automatic up to now. Especially when interactive analysis of the data is the main goal of the visualization, tools supporting interactive specification of features are needed. In this paper we present a framework for flexible and interactive specification of high-dimensional and/or complex features in simulation data. The framework makes use of multiple, linked views from information as well as scientific visualization and is based on a simple and compact feature definition language (FDL). It allows the definition of one or several features, which can be complex and/or hierarchically described by brushing multiple dimensions (using non-binary and composite brushes). The result of the specification is linked to all views, thereby a focus+context style of visualization in 3D is realized. To demonstrate the usage of the specification, as well as the linked tools, applications from flow simulation in the automotive industry are presented.Item Rendering Vector Data over Global, Multi-resolution 3D Terrain(The Eurographics Association, 2003) Wartell, Zachary; Kang, Eunjung; Wasilewski, Tony; Ribarsky, William; Faust, Nickolas; G.-P. Bonneau and S. Hahmann and C. D. HansenModern desktop PCs are capable of taking 2D Geographic Information System (GIS) applications into the realm of interactive 3D virtual worlds. In prior work we developed and presented graphics algorithms and data management methods for interactive viewing of a 3D global terrain system for desktop and virtual reality systems. In this paper we present a key data structure and associated render-time algorithm for the combined display of multi-resolution 3D terrain and traditional GIS polyline vector data. Such vector data is traditionally used for representing geographic entities such as political borders, roads, rivers and cadastral informationItem Smart Hardware-Accelerated Volume Rendering(The Eurographics Association, 2003) Roettger1, Stefan; Guthe, Stefan; Weiskopf, Daniel; Ertl, Thomas; Strasser, Wolfgang; G.-P. Bonneau and S. Hahmann and C. D. HansenFor volume rendering of regular grids the display of view-plane aligned slices has proven to yield both good quality and performance. In this paper we demonstrate how to merge the most important extensions of the original 3D slicing approach, namely the pre-integration technique, volumetric clipping, and advanced lighting. Our approach allows the suppression of clipping artifacts and achieves high quality while offering the flexibility to explore volume data sets interactively with arbitrary clip objects. We also outline how to utilize the proposed volumetric clipping approach for the display of segmented data sets. Moreover, we increase the rendering quality by implementing effi cient over-sampling with the pixel shader of consumer graphics accelerators. We give prove that at least 4- times over-sampling is needed to reconstruct the ray integral with sufficient accuracy even with pre-integration. As an alternative to this brute-force over-sampling approach we propose a hardware-accelerated ray caster which is able to perform over-sampling only where needed and which is able to gain additional speed by early ray termination and space leaping.Item Post-Convolved Splatting(The Eurographics Association, 2003) Neophytou, Neophytos; Mueller, Klaus; G.-P. Bonneau and S. Hahmann and C. D. HansenOne of the most expensive operations in volume rendering is the interpolation of samples in volume space. The number of samples, in turn, depends on the resolution of the final image. Hence, viewing the volume at high magnification will incur heavy computation. In this paper, we explore an approach that limits the number of samples to the resolution of the volume, independent of the magnification factor, using a cheap post-convolution process on the interpolated samples to generate the missing samples. For X-ray, this post-convolution is needed only once, after the volume is fully projected, while in full volume rendering, the post-convolution must be applied before each shading and compositing step. Using this technique, we are able to achieve speedups of two and more, without compromising rendering quality. We demonstrate our approach using an image-aligned sheet-buffered splatting algorithm, but our conclusions readily generalize to any volume rendering algorithm that advances across the volume in a slice-based fashion.Item Hardware-assisted View-dependent Isosurface Extraction using Spherical Partition(The Eurographics Association, 2003) Gao, Jinzhu; Shen, Han-Wei; G.-P. Bonneau and S. Hahmann and C. D. HansenExtracting only the visible portion of an isosurface can improve both the computation efficiency and the rendering speed. However, the visibility test overhead can be quite high for large scale data sets. In this paper, we present a view-dependent isosurface extraction algorithm utilizing occlusion query hardware to accelerate visible isosurface extraction. A spherical partition scheme is proposed to traverse the data blocks in a layered front-to-back order. Such traversal order helps our algorithm to identify the visible isosurface blocks more quickly with fewer visibility queries. Our algorithm can compute a more complete isosurface in a smaller amount of time, and thus is suitable for time-critical visualization applications.Item Hierarchical Isosurface Segmentation Based on Discrete Curvature(The Eurographics Association, 2003) Vivodtzev, Fabien; Linsen, Lars; Bonneau, Georges-Pierre; Hamann, Bernd; Joy, Kenneth I.; Olshausen, Bruno A.; G.-P. Bonneau and S. Hahmann and C. D. HansenA high-level approach to describe the characteristics of a surface is to segment it into regions of uniform curvature behavior and construct an abstract representation given by a (topology) graph. We propose a surface segmentation method based on discrete mean and Gaussian curvature estimates. The surfaces are obtained from three-dimensional imaging data sets by isosurface extraction after data presmoothing and postprocessing the isosurfaces by a surface-growing algorithm. We generate a hierarchical multiresolution representation of the isosurface. Segmentation and graph generation algorithms can be performed at various levels of detail. At a coarse level of detail, the algorithm detects the main features of the surface. This low-resolution description is used to determine constraints for the segmentation and graph generation at the higher resolutions. We have applied our methods to MRI data sets of human brains. The hierarchical segmentation framework can be used for brainmapping purposes.Item ISOSLIDER: A System for Interactive Exploration of Isosurfaces(The Eurographics Association, 2003) Chhugani, Jatin; Vishwanath, Sudhir; Cohen, Jonathan; Kumar, Subodh; G.-P. Bonneau and S. Hahmann and C. D. HansenWe present ISOSLIDER, a system for interactive exploration of isosurfaces of a scalar field. Our algorithm focuses on fast update of isosurfaces for interactive display as a user makes small changes to the isovalue of the desired surface. We exploit the coherence of this update. Larger changes are supported as well. The update to the isosurface is made at a correct level of detail so that not too many operations need be performed nor too many triangles need be rendered. ISOSLIDER does not need to retain the entire volume in the main memory and stores most data out of core. The central idea of the ISOSLIDER algorithm is to determine salient isovalues where surface topology changes and pre-encode these changes so as to facilitate fast updates to the triangulation.