Are you Joshua Senecal?

Claim your profile

Publications (2)2.21 Total impact

  • Chapter: Compression and Occlusion Culling for Fast Isosurface Extraction from Massive Datasets
    [show abstract] [hide abstract]
    ABSTRACT: We present two algorithms for data compression and occlusion culling that im- prove interactive, adaptive isosurface extraction from large volume datasets. Our algorithm, based on hierarchical tetrahedral meshes defined by longest edge bisection, allows arbitrary isosurfaces to be adaptively extracted at interactive rates from losslessly compressed volumes where the region of interest, determined at runtime by user interaction, is decompressed on- the-fly. For interactive applications, we exploit frame-to-frame coherence between consecutive views to simplify the mesh structure in occluded regions and eliminate occluded triangles sig- nificantly reducing the complexity of the visualized surface and the underlying multiresolution volume representation. We extend the use of hardware accelerated occlusion queries to adap- tive isosurface extraction applications where the surface geometry and topology change with the level-of-detail and view-point and the user can select an arbitrary isovalue for visualization.
    06/2009: pages 303-323;
  • Article: Adaptive extraction of time-varying isosurfaces.
    [show abstract] [hide abstract]
    ABSTRACT: We present an algorithm for adaptively extracting and rendering isosurfaces from compressed time-varying volume data sets. Tetrahedral meshes defined by longest edge bisection are used to create a multiresolution representation of the volume in the spatial domain that is adapted over time to approximate the time-varying volume. The reextraction of the isosurface at each time step is accelerated with the vertex programming capabilities of modern graphics hardware. A data layout scheme which follows the access pattern indicated by mesh refinement is used to access the volume in a spatially and temporally coherent manner. This data layout scheme allows our algorithm to be used for out-of-core visualization.
    IEEE Transactions on Visualization and Computer Graphics 10(6):683-94. · 2.21 Impact Factor