By Topic

IEEE Transactions on Visualization and Computer Graphics

Issue 4 • Date July-Aug. 2004

Filter Results

Displaying Results 1 - 17 of 17
  • [Front cover]

    Publication Year: 2004, Page(s): c1
    Request permission for commercial reuse | PDF file iconPDF (269 KB)
    Freely Available from IEEE
  • [Inside front cover]

    Publication Year: 2004, Page(s): c2
    Request permission for commercial reuse | PDF file iconPDF (76 KB)
    Freely Available from IEEE
  • Guest Editor's Introduction: Special Section on IEEE Visualization

    Publication Year: 2004, Page(s): 369
    Request permission for commercial reuse | PDF file iconPDF (75 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Counting cases in substitope algorithms

    Publication Year: 2004, Page(s):371 - 384
    Cited by:  Papers (6)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (906 KB) | HTML iconHTML

    We describe how to count the cases that arise in a family of visualization techniques, including marching cubes, sweeping simplices, contour meshing, interval volumes, and separating surfaces. Counting the cases is the first step toward developing a generic visualization algorithm to produce substitopes (geometric substitutions of polytopes). We demonstrate the method using "GAP," a software syste... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A topological hierarchy for functions on triangulated surfaces

    Publication Year: 2004, Page(s):385 - 396
    Cited by:  Papers (67)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (3154 KB) | HTML iconHTML

    We combine topological and geometric methods to construct a multiresolution representation for a function over a two-dimensional domain. In a preprocessing stage, we create the Morse-Smale complex of the function and progressively simplify its topology by cancelling pairs of critical points. Based on a simple notion of dependency among these cancellations, we construct a hierarchical data structur... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Reconstruction of volume data with quadratic super splines

    Publication Year: 2004, Page(s):397 - 409
    Cited by:  Papers (17)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2610 KB) | HTML iconHTML

    We propose a new approach to reconstruct nondiscrete models from gridded volume samples. As a model, we use quadratic trivariate super splines on a uniform tetrahedral partition. We discuss the smoothness and approximation properties of our model and compare to alternative piecewise polynomial constructions. We observe, as a nonstandard phenomenon, that the derivatives of our splines yield optimal... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • O-buffer: a framework for sample-based graphics

    Publication Year: 2004, Page(s):410 - 421
    Cited by:  Papers (4)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1199 KB) | HTML iconHTML

    We present an innovative modeling and rendering primitive, called the O-buffer, as a framework for sample-based graphics. The 2D or 3D O-buffer is, in essence, a conventional image or a volume, respectively, except that samples are not restricted to a regular grid. A sample position in the O-buffer is recorded as an offset to the nearest grid point of a regular base grid (hence the name O-buffer).... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A streaming narrow-band algorithm: interactive computation and visualization of level sets

    Publication Year: 2004, Page(s):422 - 433
    Cited by:  Papers (48)  |  Patents (9)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1903 KB) | HTML iconHTML

    Deformable isosurfaces, implemented with level-set methods, have demonstrated a great potential in visualization and computer graphics for applications such as segmentation, surface processing, and physically-based modeling. Their usefulness has been limited, however, by their high computational cost and reliance on significant parameter tuning. We present a solution to these challenges by describ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Interactive visualization of three-dimensional vector fields with flexible appearance control

    Publication Year: 2004, Page(s):434 - 445
    Cited by:  Papers (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1872 KB) | HTML iconHTML

    We present an interactive texture-based algorithm for visualizing three-dimensional steady and unsteady vector fields. The goal of the algorithm is to provide a general volume rendering framework allowing the user to compute three-dimensional flow textures interactively and to modify the appearance of the visualization on the fly. To achieve our goal, we decouple the visualization pipeline into tw... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Guest Editor's Introduction: Special Section on InfoVis

    Publication Year: 2004, Page(s): 446
    Request permission for commercial reuse | PDF file iconPDF (77 KB) | HTML iconHTML
    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A model for smooth viewing and navigation of large 2D information spaces

    Publication Year: 2004, Page(s):447 - 458
    Cited by:  Papers (11)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (2236 KB) | HTML iconHTML

    Large 2D information spaces, such as maps, images, or abstract visualizations, require views at various level of detail: close ups to inspect details, overviews to maintain (literally) an overview. Users often change their view during a session. Smooth animations enable the user to maintain an overview during interactive viewing and to understand the context of separate views. We present a generic... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Robust linear dimensionality reduction

    Publication Year: 2004, Page(s):459 - 470
    Cited by:  Papers (58)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1955 KB) | HTML iconHTML

    We present a novel family of data-driven linear transformations, aimed at finding low-dimensional embeddings of multivariate data, in a way that optimally preserves the structure of the data. The well-studied PCA and Fisher's LDA are shown to be special members in this family of transformations, and we demonstrate how to generalize these two methods such as to enhance their performance. Furthermor... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Conveying shape with texture: experimental investigations of texture's effects on shape categorization judgments

    Publication Year: 2004, Page(s):471 - 483
    Cited by:  Papers (14)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (5166 KB) | HTML iconHTML

    We describe the results of two comprehensive controlled observer experiments intended to yield insight into the following question: If we could design the ideal texture pattern to apply to an arbitrary smoothly curving surface in order to enable its 3D shape to be most accurately and effectively perceived, what would the characteristics of that texture pattern be? We begin by reviewing the results... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Multiresolution indexing of triangulated irregular networks

    Publication Year: 2004, Page(s):484 - 495
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (892 KB) | HTML iconHTML

    We show how to build a continuous, one-dimensional index of the points on a triangulated irregular network (TIN). The index is constructed by first finding an ordering of the triangles in which consecutive triangles share a vertex or an edge. Then, the space within each triangle is continuously indexed with a space-filling curve that begins at one vertex of the triangle and ends at another. The sp... View full abstract»

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

    Publication Year: 2004, Page(s): 496
    Request permission for commercial reuse | PDF file iconPDF (318 KB)
    Freely Available from IEEE
  • TVCG Information for authors

    Publication Year: 2004, Page(s): c3
    Request permission for commercial reuse | PDF file iconPDF (76 KB)
    Freely Available from IEEE
  • [Back cover]

    Publication Year: 2004, Page(s): c4
    Request permission for commercial reuse | PDF file iconPDF (269 KB)
    Freely Available from IEEE

Aims & Scope

Visualization techniques and methodologies; visualization systems and software; volume visualization; flow visualization; multivariate visualization; modeling and surfaces; rendering; animation; user interfaces; visual progranuning; applications.

Full Aims & Scope

Meet Our Editors

Editor-in-Chief
Leila De Floriani
Department of Computer Science, Bioengineering, Robotics and Systems Engineering
University of Genova
16146 Genova (Italy)
ldf4tvcg@umiacs.umd.edu