Scheduled Maintenance on May 23rd, 2017:
IEEE Xplore will undergo an upgrade from 1:00 - 4:00 PM EDT. During this time there may be intermittent impact on performance. We apologize for any inconvenience.
By Topic

18-23 Oct. 1998

Filter Results

Displaying Results 1 - 25 of 78
  • Proceedings Visualization '98 (Cat. No.98CB36276)

    Publication Year: 1998
    Request permission for commercial reuse | PDF file iconPDF (345 KB)
    Freely Available from IEEE
  • Large scale terrain visualization using the restricted quadtree triangulation

    Publication Year: 1998, Page(s):19 - 26
    Cited by:  Papers (67)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (175 KB)

    Real-time rendering of triangulated surfaces has attracted growing interest in the last few years. However, interactive visualization of very large scale grid digital elevation models is still difficult. The graphics load must be controlled by adaptive surface triangulation and by taking advantage of different levels of detail. Furthermore, management of the visible scene requires efficient access... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Contour interpolation and surface reconstruction of smooth terrain models

    Publication Year: 1998, Page(s):27 - 33
    Cited by:  Papers (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (484 KB)

    Interpolating contours and reconstructing a rational surface from a contour map are two essential problems in terrain modeling. They are often met in the field of computer graphics and CAD systems based on geographic information systems. Although many approaches have been developed for these two problems, one difficulty still remains. That is how to ensure that the reconstructed surface is both sm... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Smooth view-dependent level-of-detail control and its application to terrain rendering

    Publication Year: 1998, Page(s):35 - 42
    Cited by:  Papers (128)  |  Patents (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (441 KB)

    The key to real-time rendering of large-scale surfaces is to locally adapt surface geometric complexity to changing view parameters. Several schemes have been developed to address this problem of view-dependent level-of-detail control. Among these, the view-dependent progressive mesh (VDPM) framework represents an arbitrary triangle mesh as a hierarchy of geometrically optimized refinement transfo... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient implementation of multi-triangulations

    Publication Year: 1998, Page(s):43 - 50
    Cited by:  Papers (28)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (308 KB)

    Multi-triangulation (MT) is a general framework for managing the level-of-detail in large triangle meshes, which we have introduced in our previous work. In this paper, we describe an efficient implementation of an MT based on vertex decimation. We present general techniques for querying an MT, which are independent of a specific application, and which can be applied for solving problems, such as ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visualization of scalar topology for structural enhancement

    Publication Year: 1998, Page(s):51 - 58
    Cited by:  Papers (15)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (294 KB)

    Scalar fields arise in every scientific application. Existing scalar visualization techniques require that the user infers the global scalar structure from what is frequently an insufficient display of information. We present a visualization technique which numerically detects the structure at all scales, removing from the user the responsibility of extracting information implicit in the data, and... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A general method for preserving attribute values on simplified meshes

    Publication Year: 1998, Page(s):59 - 66
    Cited by:  Papers (16)  |  Patents (15)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1512 KB)

    Many sophisticated solutions have been proposed to reduce the geometric complexity of 3D meshes. A problem studied less often is how to preserve on a simplified mesh the detail (e.g., color, high frequency shape detail, scalar fields, etc.) which is encoded in the original mesh. We present a general approach for preserving detail on simplified meshes. The detail (or high frequency information) los... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Surface reconstruction with anisotropic density-scaled alpha shapes

    Publication Year: 1998, Page(s):67 - 72
    Cited by:  Papers (13)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (371 KB)

    Generation of a three-dimensional model from an unorganized set of points is an active area of research in computer graphics. Alpha shapes can be employed to construct a surface which most closely reflects the object described by the points. However, no α-shape, for any value of α, can properly detail discontinuous regions of a model. We introduce herein two methods of improving the re... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Level of detail visualization of scalar data sets on irregular surface meshes

    Publication Year: 1998, Page(s):73 - 77
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (240 KB)

    In this article, we build a multi-resolution framework intended to be used for the visualization of continuous piecewise linear functions defined over triangular planar or spherical meshes. In particular, the data set can be viewed at different level of detail, that's to say as a piecewise linear function defined over any simplification of the base mesh. In his multi-resolution form, the function ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Tracking scalar features in unstructured data sets

    Publication Year: 1998, Page(s):79 - 86
    Cited by:  Papers (21)  |  Patents (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (305 KB)

    3D time-varying unstructured and structured data sets are difficult to visualize and analyze because of the immense amount of data involved. These data sets contain many evolving amorphous regions, and standard visualization techniques provide no facilities to aid the scientist to follow regions of interest. In this paper, we present a basic framework for the visualization of time-varying data set... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Feature detection in linked derived spaces

    Publication Year: 1998, Page(s):87 - 94
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2603 KB)

    This paper describes by example a strategy for plotting and interacting with data in multiple metric spaces. The example system was designed for use with time-varying computational fluid dynamics (CFD) data sets, but the methodology is directly applicable to other types of field data. The central objects embodied by the tool are portraits, which show the data in various coordinate systems, while p... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Extremal feature extraction from 3-D vector and noisy scalar fields

    Publication Year: 1998, Page(s):95 - 102
    Cited by:  Papers (6)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (294 KB)

    We are interested in feature extraction from volume data in terms of coherent surfaces and 3D space curves. The input can be an inaccurate scalar or vector field, sampled densely or sparsely on a regular 3D grid, in which poor resolution and the presence of spurious noisy samples make traditional iso-surface techniques inappropriate. In this paper, we present a general-purpose methodology to extra... View full abstract»

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

    Publication Year: 1998, Page(s):103 - 109
    Cited by:  Papers (21)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (184 KB)

    A novel approach is introduced to define a quantitative measure of closeness between vector fields. The usefulness of this measurement can be seen when comparing computational and experimental flow fields under the same conditions. Furthermore, its applicability can be extended to more cumbersome tasks, such as navigating through a large database, searching for similar topologies. This new measure... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Building perceptual textures to visualize multidimensional datasets

    Publication Year: 1998, Page(s):111 - 118
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (288 KB)

    Presents a new method for using texture to visualize multi-dimensional data elements arranged on an underlying 3D height field. We hope to use simple texture patterns in combination with other visual features like hue and intensity to increase the number of attribute values we can display simultaneously. Our technique builds perceptual texture elements (or pexels) to represent each data element. A... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Efficient co-triangulation of large data sets

    Publication Year: 1998, Page(s):119 - 126
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (262 KB)

    Presents an efficient algorithm for the reconstruction of a multivariate function from multiple sets of scattered data. Given N sets of scattered data representing N distinct dependent variables that have been sampled independently over a common domain and N error tolerance values, the algorithm constructs a triangulation of the domain of the data and associates multivariate values with the vertic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Visualizing diffusion tensor images of the mouse spinal cord

    Publication Year: 1998, Page(s):127 - 134
    Cited by:  Papers (48)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1671 KB)

    Within biological systems, water molecules undergo continuous stochastic Brownian motion. The diffusion rate can give clues to the structure of the underlying tissues. In some tissues, the rate is anisotropic. Diffusion-rate images can be calculated from diffusion-weighted MRI. A 2D diffusion tensor image (DTI) and an associated anatomical scalar field define seven values at each spatial location.... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Image-guided streamline placement on curvilinear grid surfaces

    Publication Year: 1998, Page(s):135 - 142
    Cited by:  Papers (18)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (380 KB)

    The success of using a streamline technique for visualizing a vector field usually depends largely on the choice of adequate seed points. G. Turk and D. Banks (1996) developed an elegant technique for automatically placing seed points to achieve a uniform distribution of streamlines on a 2D vector field. Their method uses an energy function calculated from the low-pass filtered streamline image to... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A higher-order method for finding vortex core lines

    Publication Year: 1998, Page(s):143 - 150
    Cited by:  Papers (37)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (522 KB)

    This paper presents a novel method to extract vortical structures from 3D CFD (computational fluid dynamics) vector fields automatically. It discusses the underlying theory and some aspects of the implementation. Making use of higher-order derivatives, the method is able to locate bent vortices. In order to structure the recognition procedure, we distinguish locating the core line from calculating... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Automatic detection of open and closed separation and attachment lines

    Publication Year: 1998, Page(s):151 - 158
    Cited by:  Papers (20)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (323 KB)

    A fully automatic feature detection algorithm is presented that locates and distinguishes lines of flow separation and attachment on surfaces in 3D numerical flow fields. The algorithm is based on concepts from 2D phase-plane analysis of linear vector fields. Unlike prior visualization techniques based on particle tracing or flow topology, the phase-plane algorithm detects separation using local a... 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 hierarchical index tree

    Publication Year: 1998, Page(s):159 - 166
    Cited by:  Papers (21)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (218 KB)

    Many high-performance isosurface extraction algorithms have been proposed in the past several years as a result of intensive research efforts. When applying these algorithms to large-scale time-varying fields, the storage overhead incurred from storing the search index often becomes overwhelming. This paper proposes an algorithm for locating isosurface cells in time-varying fields. We devise a new... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive out-of-core isosurface extraction

    Publication Year: 1998, Page(s):167 - 174
    Cited by:  Papers (41)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (209 KB)

    We present a novel out-of-core technique for the interactive computation of isosurfaces from volume data. Our algorithm minimizes the main memory and disk space requirements on the visualization workstation, while speeding up isosurface extraction queries. Our overall approach is a two-level indexing scheme. First, by our meta-cell technique, we partition the original dataset into clusters of cell... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • View dependent isosurface extraction

    Publication Year: 1998, Page(s):175 - 180
    Cited by:  Papers (36)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (220 KB)

    We propose a new approach to polygonal isosurface extraction that is based on extracting only the visible portion of the isosurface. The visibility tests are done in two phases. First, coarse visibility tests are performed in software to determine the visible cells. These tests are based on hierarchical tiles and shear-warp factorization. The second phase resolves the visible portions of the extra... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The Gridfit algorithm: an efficient and effective approach to visualizing large amounts of spatial data

    Publication Year: 1998, Page(s):181 - 188
    Cited by:  Papers (13)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (496 KB)

    In a large number of applications, data is collected and referenced by their spatial locations. Visualizing large amounts of spatially referenced data on a limited-size screen display often results in poor visualizations due to the high degree of overplotting of neighboring datapoints. We introduce a new approach to visualizing large amounts of spatially referenced data. The basic idea is to intel... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • TOPIC ISLANDSTM-a wavelet-based text visualization system

    Publication Year: 1998, Page(s):189 - 196
    Cited by:  Papers (22)  |  Patents (34)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (500 KB)

    We present a novel approach to visualize and explore unstructured text. The underlying technology, called TOPIC-O-GRAPHYTM, applies wavelet transforms to a custom digital signal constructed from words within a document. The resultant multiresolution wavelet energy is used to analyze the characteristics of the narrative flow in the frequency domain, such as theme changes, which is then r... View full abstract»

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

    Publication Year: 1998, Page(s):197 - 204
    Cited by:  Papers (9)  |  Patents (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (51 KB)

    Area cartograms are used for visualizing geographically distributed data by attaching measurements to regions of a map and scaling the regions such that their areas are proportional to the measured quantities. A continuous area cartogram is a cartogram that is constructed without changing the underlying map topology. We present a new algorithm for the construction of continuous area cartograms tha... View full abstract»

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