Efficient, high-quality, GPU-based visualization of voxelized surface data with fine and complicated structures

Sven Forstmann, Jun Ohya

    Research output: Contribution to journalArticle

    2 Citations (Scopus)

    Abstract

    This paper proposes a GPU-based method that can visualize voxelized surface data with fine and complicated features, has high rendering quality at interactive frame rates, and provides low memory consumption. The surface data is compressed using run-length encoding (RLE) for each level of detail (LOD). Then, the loop for the rendering process is performed on the GPU for the position of the viewpoint at each time instant. The scene is raycasted in planes, where each plane is perpendicular to the horizontal plane in the world coordinate system and passes through the viewpoint. For each plane, one ray is cast to rasterize all RLE elements intersecting this plane, starting from the viewpoint and ranging up to the maximum view distance. This rasterization process projects each RLE element passing the occlusion test onto the screen at a LOD that decreases with the distance of the RLE element from the viewpoint. Finally, the smoothing of voxels in screen space and full screen anti-aliasing is performed. To provide lighting calculations without storing the normal vector inside the RLE data structure, our algorithm recovers the normal vectors from the rendered scene's depth buffer. After the viewpoint changes, the same process is re-executed for the new viewpoint. Experiments using different scenes have shown that the proposed algorithm is faster than the equivalent CPU implementation and other related methods. Our experiments further prove that this method is memory efficient and achieves high quality results.

    Original languageEnglish
    Pages (from-to)3088-3099
    Number of pages12
    JournalIEICE Transactions on Information and Systems
    VolumeE93-D
    Issue number11
    DOIs
    Publication statusPublished - 2010 Nov

    Fingerprint

    Visualization
    Anti-aliasing
    Data storage equipment
    Program processors
    Data structures
    Lighting
    Experiments
    Graphics processing unit
    Rasterization
    Rendering (computer graphics)

    Keywords

    • Raycasting
    • Run-length encoding
    • Splatting
    • View-transform
    • Volume data
    • Voxels

    ASJC Scopus subject areas

    • Electrical and Electronic Engineering
    • Software
    • Artificial Intelligence
    • Hardware and Architecture
    • Computer Vision and Pattern Recognition

    Cite this

    Efficient, high-quality, GPU-based visualization of voxelized surface data with fine and complicated structures. / Forstmann, Sven; Ohya, Jun.

    In: IEICE Transactions on Information and Systems, Vol. E93-D, No. 11, 11.2010, p. 3088-3099.

    Research output: Contribution to journalArticle

    @article{98591b0c068c4d44ba304ada8b3eaedb,
    title = "Efficient, high-quality, GPU-based visualization of voxelized surface data with fine and complicated structures",
    abstract = "This paper proposes a GPU-based method that can visualize voxelized surface data with fine and complicated features, has high rendering quality at interactive frame rates, and provides low memory consumption. The surface data is compressed using run-length encoding (RLE) for each level of detail (LOD). Then, the loop for the rendering process is performed on the GPU for the position of the viewpoint at each time instant. The scene is raycasted in planes, where each plane is perpendicular to the horizontal plane in the world coordinate system and passes through the viewpoint. For each plane, one ray is cast to rasterize all RLE elements intersecting this plane, starting from the viewpoint and ranging up to the maximum view distance. This rasterization process projects each RLE element passing the occlusion test onto the screen at a LOD that decreases with the distance of the RLE element from the viewpoint. Finally, the smoothing of voxels in screen space and full screen anti-aliasing is performed. To provide lighting calculations without storing the normal vector inside the RLE data structure, our algorithm recovers the normal vectors from the rendered scene's depth buffer. After the viewpoint changes, the same process is re-executed for the new viewpoint. Experiments using different scenes have shown that the proposed algorithm is faster than the equivalent CPU implementation and other related methods. Our experiments further prove that this method is memory efficient and achieves high quality results.",
    keywords = "Raycasting, Run-length encoding, Splatting, View-transform, Volume data, Voxels",
    author = "Sven Forstmann and Jun Ohya",
    year = "2010",
    month = "11",
    doi = "10.1587/transinf.E93.D.3088",
    language = "English",
    volume = "E93-D",
    pages = "3088--3099",
    journal = "IEICE Transactions on Information and Systems",
    issn = "0916-8532",
    publisher = "Maruzen Co., Ltd/Maruzen Kabushikikaisha",
    number = "11",

    }

    TY - JOUR

    T1 - Efficient, high-quality, GPU-based visualization of voxelized surface data with fine and complicated structures

    AU - Forstmann, Sven

    AU - Ohya, Jun

    PY - 2010/11

    Y1 - 2010/11

    N2 - This paper proposes a GPU-based method that can visualize voxelized surface data with fine and complicated features, has high rendering quality at interactive frame rates, and provides low memory consumption. The surface data is compressed using run-length encoding (RLE) for each level of detail (LOD). Then, the loop for the rendering process is performed on the GPU for the position of the viewpoint at each time instant. The scene is raycasted in planes, where each plane is perpendicular to the horizontal plane in the world coordinate system and passes through the viewpoint. For each plane, one ray is cast to rasterize all RLE elements intersecting this plane, starting from the viewpoint and ranging up to the maximum view distance. This rasterization process projects each RLE element passing the occlusion test onto the screen at a LOD that decreases with the distance of the RLE element from the viewpoint. Finally, the smoothing of voxels in screen space and full screen anti-aliasing is performed. To provide lighting calculations without storing the normal vector inside the RLE data structure, our algorithm recovers the normal vectors from the rendered scene's depth buffer. After the viewpoint changes, the same process is re-executed for the new viewpoint. Experiments using different scenes have shown that the proposed algorithm is faster than the equivalent CPU implementation and other related methods. Our experiments further prove that this method is memory efficient and achieves high quality results.

    AB - This paper proposes a GPU-based method that can visualize voxelized surface data with fine and complicated features, has high rendering quality at interactive frame rates, and provides low memory consumption. The surface data is compressed using run-length encoding (RLE) for each level of detail (LOD). Then, the loop for the rendering process is performed on the GPU for the position of the viewpoint at each time instant. The scene is raycasted in planes, where each plane is perpendicular to the horizontal plane in the world coordinate system and passes through the viewpoint. For each plane, one ray is cast to rasterize all RLE elements intersecting this plane, starting from the viewpoint and ranging up to the maximum view distance. This rasterization process projects each RLE element passing the occlusion test onto the screen at a LOD that decreases with the distance of the RLE element from the viewpoint. Finally, the smoothing of voxels in screen space and full screen anti-aliasing is performed. To provide lighting calculations without storing the normal vector inside the RLE data structure, our algorithm recovers the normal vectors from the rendered scene's depth buffer. After the viewpoint changes, the same process is re-executed for the new viewpoint. Experiments using different scenes have shown that the proposed algorithm is faster than the equivalent CPU implementation and other related methods. Our experiments further prove that this method is memory efficient and achieves high quality results.

    KW - Raycasting

    KW - Run-length encoding

    KW - Splatting

    KW - View-transform

    KW - Volume data

    KW - Voxels

    UR - http://www.scopus.com/inward/record.url?scp=78049501959&partnerID=8YFLogxK

    UR - http://www.scopus.com/inward/citedby.url?scp=78049501959&partnerID=8YFLogxK

    U2 - 10.1587/transinf.E93.D.3088

    DO - 10.1587/transinf.E93.D.3088

    M3 - Article

    AN - SCOPUS:78049501959

    VL - E93-D

    SP - 3088

    EP - 3099

    JO - IEICE Transactions on Information and Systems

    JF - IEICE Transactions on Information and Systems

    SN - 0916-8532

    IS - 11

    ER -