By Topic

Parallel and Large-Data Visualization and Graphics, 2003. PVG 2003. IEEE Symposium on

Date 21-21 Oct. 2003

Filter Results

Displaying Results 1 - 13 of 13
  • IEEE Symposium on Parallel and Large-Data Visualization and Graphics 2003 (IEEE Cat. No.3EX736)

    Publication Year: 2003
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (99 KB)

    The following topics are dealt with: interative rendering; data visualisation; computational geometry; solid modelling; isosurface extraction; parallel processing; load balancing; workstation cluster; image resolution; distributed memory system; image cache; multiprocessing system; image texture; ray tracing; natural scene; interactive system; feature extraction; hidden feature removal; image retr... View full abstract»

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

    Publication Year: 2003, Page(s):9 - 16
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (234 KB) | HTML iconHTML

    A new approach for large dataset isosurface extraction is presented. The approach's aim is efficient parallel isosurfacing when the dataset cannot be processed entirely in-core. The approach focuses on reducing the memory requirement and optimizing disk I/O while achieving a balanced load. In particular, an accurate model of isosurface extraction time is exploited to evenly distribute work across ... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A parallel framework for simplification of massive meshes

    Publication Year: 2003, Page(s):17 - 24
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (549 KB) | HTML iconHTML

    As polygonal models rapidly grow to sizes orders of magnitudes bigger than the memory of commodity workstations, a viable approach to simplifying such models is parallel mesh simplification algorithms. A naive approach that divides the model into a number of equally sized chunks and distributes them to a number of potentially heterogeneous workstations is bound to fail. In severe cases the computa... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • From cluster to wall with VTK

    Publication Year: 2003, Page(s):25 - 31
    Cited by:  Papers (7)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (273 KB) | HTML iconHTML

    We describe a new set of parallel rendering components for VTK, the visualization toolkit. The parallel rendering units allow for the rendering of vast quantities of geometry with a focus on cluster computers. Furthermore, the geometry may be displayed on tiled displays at full or reduced resolution. We demonstrate an interactive VTK application processing an isosurface consisting of nearly half a... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Sort-first, distributed memory parallel visualization and rendering

    Publication Year: 2003, Page(s):41 - 50
    Cited by:  Papers (6)  |  Patents (5)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (303 KB) | HTML iconHTML

    While commodity computing and graphics hardware has increased in capacity and dropped in cost, it is still quite difficult to make effective use of such systems for general-purpose parallel visualization and graphics. We describe the results of a recent project that provides a software infrastructure suitable for general-purpose use by parallel visualization and graphics applications. Our work com... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Parallel cell projection rendering of adaptive mesh refinement data

    Publication Year: 2003, Page(s):51 - 60
    Cited by:  Papers (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (278 KB) | HTML iconHTML

    Adaptive mesh refinement (AMR) is a technique used in numerical simulations to automatically refine (or de-refine) certain regions of the physical domain in a finite difference calculation. AMR data consists of nested hierarchies of data grids. As AMR visualization is still a relatively unexplored topic, our work is motivated by the need to perform efficient visualization of large AMR data sets. W... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A multilayered image cache for scientific visualization

    Publication Year: 2003, Page(s):61 - 67
    Cited by:  Papers (3)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (310 KB) | HTML iconHTML

    We introduce a multilayered image cache system that is designed to work with a pool of rendering engines to facilitate a frame-less, asynchronous rendering environment for scientific visualization. Our system decouples the rendering from the display of imagery at many levels; it decouples render frequency and resolution from display frequency and resolution; allows asynchronous transmission of ima... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Real-time volume rendering of time-varying data using a fragment-shader compression approach

    Publication Year: 2003, Page(s):69 - 75
    Cited by:  Papers (4)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (293 KB) | HTML iconHTML

    The recent advance of graphics hardware allowed real-time volume rendering of structured grids using a 3D texturing approach. The next challenging problem is to extend the algorithms to time-varying volumetric data (4D functions), which consume more storage and are not directly supported in current graphics hardware. Here we present a new visualization technique that includes (1) a compression sch... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Distributed interactive ray tracing of dynamic scenes

    Publication Year: 2003, Page(s):77 - 85
    Cited by:  Papers (21)  |  Patents (10)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (492 KB) | HTML iconHTML

    Recently developed interactive ray tracing systems combine the high performance of todays CPUs with new algorithms and implementations to achieve a flexible and high-performance rendering system offering high-quality, but nonetheless interactive 3D graphics. However, due to its history in offline rendering, interactive ray tracing is usually limited to static scenes and simple walkthroughs. In ord... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • A PC cluster system for simultaneous interactive volumetric modeling and visualization

    Publication Year: 2003, Page(s):95 - 102
    Cited by:  Papers (8)  |  Patents (1)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (1099 KB) | HTML iconHTML

    A number of problems are well suited for volumetric representation for both simulation and storage, however, the large amount of data that needs to be processed and rendered with these volumes makes interactive manipulation extremely challenging. We present a scalable PC cluster system (VG cluster) designed specifically to enable simultaneous volumetric computation and visualization, using composi... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • The feature tree: visualizing feature tracking in distributed AMR datasets

    Publication Year: 2003, Page(s):103 - 110
    Cited by:  Papers (12)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (566 KB) | HTML iconHTML

    We describe a feature extraction and tracking algorithm for AMR (adaptive mesh refinement) datasets that operates within a distributed computing environment. Because features can span multiple refinement levels and multiple processors, tracking must be performed across time, across levels, and across processors. The resulting visualization is represented as a "feature tree". A feature contains mul... View full abstract»

    Full text access may be available. Click article title to sign in or learn about subscription options.
  • Improving occlusion query efficiency with occupancy maps

    Publication Year: 2003, Page(s):111 - 118
    Cited by:  Papers (2)
    Request permission for commercial reuse | Click to expandAbstract | PDF file iconPDF (406 KB) | HTML iconHTML

    Image space occlusion culling is an useful approach to reduce the rendering load of large polygonal models. Like most large model techniques, it trades overhead costs with the rendering costs of the possibly occluded geometry. Meanwhile, modern graphics hardware supports occlusion culling, whereas they associate a significant query overhead, which hurts in particular, if the occlusion culling quer... View full abstract»

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

    Publication Year: 2003, Page(s): 119
    Request permission for commercial reuse | PDF file iconPDF (29 KB)
    Freely Available from IEEE