Proceedings Visualization '99 (Cat. No.99CB37067)

24-29 Oct. 1999

Filter Results

Displaying Results 1 - 25 of 74
  • Proceedings Visualization '99 (Cat. No.99CB37067)

    Publication Year: 1999
    Request permission for reuse | PDF file iconPDF (311 KB)
    Freely Available from IEEE
  • Table of contents

    Publication Year: 1999, Page(s):5 - 10
    Request permission for reuse | PDF file iconPDF (311 KB)
    Freely Available from IEEE
  • Construction of vector field hierarchies

    Publication Year: 1999, Page(s):19 - 25, 505
    Cited by:  Papers (48)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (882 KB)

    Presents a method for the hierarchical representation of vector fields. Our approach is based on iterative refinement using clustering and principal component analysis. The input to our algorithm is a discrete set of points with associated vectors. The algorithm generates a top-down segmentation of the discrete field by splitting clusters of points. We measure the error of the various approximatio... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Large field visualization with demand-driven calculation

    Publication Year: 1999, Page(s):27 - 506
    Cited by:  Papers (10)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (4227 KB)

    Presents a system designed for the interactive definition and visualization of fields derived from large data sets: the Demand-Driven Visualizer (DDV). The system allows the user to write arbitrary expressions to define new fields, and then apply a variety of visualization techniques to the result. Expressions can include differential operators and numerous other built-in functions. Determination ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Simplified representation of vector fields

    Publication Year: 1999, Page(s):35 - 507
    Cited by:  Papers (62)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (3540 KB)

    Vector field visualization remains a difficult task. Many local and global visualization methods for vector fields such as flow data exist, but they usually require extensive user experience on setting the visualization parameters in order to produce images communicating the desired insight. We present a visualization method that produces simplified but suggestive images of the vector field automa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hierarchical parallel coordinates for exploration of large datasets

    Publication Year: 1999, Page(s):43 - 508
    Cited by:  Papers (58)  |  Patents (5)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1849 KB)

    Our ability to accumulate large, complex (multivariate) data sets has far exceeded our ability to effectively process them in searching for patterns, anomalies and other interesting features. Conventional multivariate visualization techniques generally do not scale well with respect to the size of the data set. The focus of this paper is on the interactive visualization of large multivariate data ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tetrahedral mesh compression with the cut-border machine

    Publication Year: 1999, Page(s):51 - 509
    Cited by:  Papers (17)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (2458 KB)

    In recent years, substantial progress has been achieved in the area of volume visualization on irregular grids, which is mainly based on tetrahedral meshes. Even moderately fine tetrahedral meshes consume several mega-bytes of storage. For archivation and transmission compression algorithms are essential. In scientific applications lossless compression schemes are of primary interest. This paper i... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • New quadric metric for simplifying meshes with appearance attributes

    Publication Year: 1999, Page(s):59 - 510
    Cited by:  Papers (119)  |  Patents (16)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1996 KB)

    Complex triangle meshes arise naturally in many areas of computer graphics and visualization. Previous work has shown that a quadric error metric allows fast and accurate geometric simplification of meshes. This quadric approach was recently generalized to handle meshes with appearance attributes. In this paper we present an improved quadric error metric for simplifying meshes with attributes. The... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient compression of non-manifold polygonal meshes

    Publication Year: 1999, Page(s):73 - 512
    Cited by:  Papers (14)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1508 KB)

    We present a method for compressing non-manifold polygonal meshes, i.e. polygonal meshes with singularities, which occur very frequently in the real-world. Most efficient polygonal compression methods currently available are restricted to a manifold mesh: they require a conversion process, and fail to retrieve the original model connectivity after decompression. The present method works by convert... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image graphs-a novel approach to visual data exploration

    Publication Year: 1999, Page(s):81 - 88
    Cited by:  Papers (29)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (559 KB)

    For types of data visualization where the cost of producing images is high, and the relationship between the rendering parameters and the image produced is less than obvious, a visual representation of the exploration process can make the process more efficient and effective. Image graphs represent not only the results but also the process of data visualization. Each node in an image graph consist... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Forward image mapping

    Publication Year: 1999, Page(s):89 - 514
    Cited by:  Papers (6)  |  Patents (10)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (244 KB)

    We present a novel forward image mapping algorithm, which speeds up perspective warping, as in texture mapping. It processes the source image in a special scanline order instead of the normal raster scanline order. This special scanline has the property of preserving parallelism when projecting to the target image. The algorithm reduces the complexity of perspective-correct image warping by elimin... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Structured spatial domain image and data comparison metrics

    Publication Year: 1999, Page(s):97 - 515
    Cited by:  Papers (13)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (619 KB)

    Often, images or datasets have to be compared to facilitate choices of visualization and simulation parameters respectively. Common comparison techniques include side-by-side viewing and juxtaposition, in order to facilitate visual verification of verisimilitude. We propose quantitative techniques which accentuate differences in images and datasets. The comparison is enabled through a collection o... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feature comparisons of 3-D vector fields using earth mover's distance

    Publication Year: 1999, Page(s):105 - 114
    Cited by:  Papers (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (168 KB)

    A method for comparing three-dimensional vector fields constructed from simple critical points is described. This method is a natural extension of previous work (Y. Lavin et al., 1998), which defined a distance metric for comparing two-dimensional fields. The extension to three-dimensions follows the path of our previous work, rethinking the representation of a critical point signature and the dis... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Rendering on a budget: a framework for time-critical rendering

    Publication Year: 1999, Page(s):115 - 516
    Cited by:  Papers (9)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (377 KB)

    We present a technique for optimizing the rendering of high-depth complexity scenes. Prioritized-Layered Projection (PLP) does this by rendering an estimation of the visible set. The novelty in our work lies in the fact that we do not explicitly compute visible sets. Instead, our work is based on computing on demand a priority order for the polygons that maximizes the likelihood of rendering visib... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Time-critical multiresolution scene rendering

    Publication Year: 1999, Page(s):123 - 517
    Cited by:  Papers (11)  |  Patents (2)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (811 KB)

    We describe a framework for time-critical rendering of graphics scenes composed of a large number of objects having complex geometric descriptions. Our technique relies upon a scene description in which objects are represented as multiresolution meshes. We perform a constrained optimization at each frame to choose the resolution of each potentially visible object that generates the best quality im... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Skip Strips: maintaining triangle strips for view-dependent rendering

    Publication Year: 1999, Page(s):131 - 518
    Cited by:  Papers (21)  |  Patents (1)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1975 KB)

    View-dependent simplification has emerged as a powerful tool for graphics acceleration in visualization of complex environments. However, view-dependent simplification techniques have not been able to take full advantage of the underlying graphics hardware. Specifically, triangle strips are a widely used hardware-supported mechanism to compactly represent and efficiently render static triangle mes... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Isosurface extraction techniques for Web-based volume visualization

    Publication Year: 1999, Page(s):139 - 519
    Cited by:  Papers (15)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (2272 KB)

    The reconstruction of isosurfaces from scalar volume data has positioned itself as a fundamental visualization technique in many different applications. But the dramatically increasing size of volumetric data sets often prohibits the handling of these models on affordable low-end single processor architectures. Distributed client-server systems integrating high-bandwidth transmission channels and ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Isosurface extraction in time-varying fields using a Temporal Branch-on-Need Tree (T-BON)

    Publication Year: 1999, Page(s):147 - 520
    Cited by:  Papers (29)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1370 KB)

    The Temporal Branch-on-Need Tree (T-BON) extends the three dimensional branch-on-need octree for time-varying isosurface extraction. At each time step, only those portions of the tree and data necessary to construct the current isosurface are read from disk. This algorithm can thus exploit the temporal locality of the isosurface and, as a geometric technique, spatial locality between cells in orde... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive lens visualization techniques

    Publication Year: 1999, Page(s):155 - 521
    Cited by:  Papers (4)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (195 KB)

    The paper describes new techniques for minimally immersive visualization of 3D scalar and vector fields, and visualization of document corpora. In our glyph based visualization system, the user interacts with the 3D volume of glyphs using a pair of button-enhanced 3D position and orientation trackers. The user may also examine the volume using an interactive lens, which is a rectangle that slices ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-projector displays using camera-based registration

    Publication Year: 1999, Page(s):161 - 522
    Cited by:  Papers (142)  |  Patents (52)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (2145 KB)

    Conventional projector-based display systems are typically designed around precise and regular configurations of projectors and display surfaces. While this results in rendering simplicity and speed, it also means painstaking construction and ongoing maintenance. In previously published work, we introduced a vision of projector-based displays constructed from a collection of casually-arranged proj... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Exploring geo-scientific data in virtual environments

    Publication Year: 1999, Page(s):169 - 173
    Cited by:  Papers (12)  |  Patents (19)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (1160 KB)

    This paper describes tools and techniques for the exploration of gee-scientific data from the oil and gas domain in stereoscopic virtual environments. The two main sources of data in the exploration task are seismic volumes and multivariate well logs of physical properties down a bore hole. We have developed a props-based interaction device called the cubic mouse to allow more direct and intuitive... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Animating wrinkles on clothes

    Publication Year: 1999, Page(s):175 - 523
    Cited by:  Papers (27)  |  Patents (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (2438 KB)

    This paper describes a method to simulate realistic wrinkles on clothes without fine mesh and large computational overheads. Cloth has very little in-plane deformations, as most of the deformations come from buckling. This can be looked at as area conservation property of cloth. The area conservation formulation of the method modulates the user defined wrinkle pattern, based on deformation of indi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Hue-balls and lit-tensors for direct volume rendering of diffusion tensor fields

    Publication Year: 1999, Page(s):183 - 524
    Cited by:  Papers (44)  |  Patents (3)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (4665 KB)

    With the development of magnetic resonance imaging techniques for acquiring diffusion tensor data from biological tissue, visualization of tensor data has become a new research focus. The diffusion tensor describes the directional dependence of water molecules' diffusion and can be represented by a three-by-three symmetric matrix. Visualization of second-order tensor fields is difficult because th... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Mixing translucent polygons with volumes

    Publication Year: 1999, Page(s):191 - 525
    Cited by:  Papers (13)  |  Patents (12)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (544 KB)

    We present an algorithm which renders opaque and/or translucent polygons embedded within volumetric data. The processing occurs such that all objects are composited in the correct order, by rendering thin slabs of the translucent polygons between volume slices using slice-order volume rendering. We implemented our algorithm with OpenGL on current general-purpose graphics systems. We discuss our sy... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multi-resolution multi-field ray tracing: a mathematical overview

    Publication Year: 1999, Page(s):199 - 206
    Cited by:  Patents (7)
    Request permission for reuse | Click to expandAbstract | PDF file iconPDF (171 KB)

    A rigorous mathematical review of ray tracing is presented. The concept of a generic voxel decoder acting on flexible voxel formats is introduced. The necessity of interpolating opacity weighted colors is proved, using a new definition of the blending process in terms of functional integrals. The continuum limit of the discrete opacity accumulation formula is presented, and its convexity propertie... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.