All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

QuadStack: An Efficient Representation and Direct Rendering of Layered Datasets

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F21%3A00343857" target="_blank" >RIV/68407700:21230/21:00343857 - isvavai.cz</a>

  • Result on the web

    <a href="https://doi.org/10.1109/TVCG.2020.2981565" target="_blank" >https://doi.org/10.1109/TVCG.2020.2981565</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1109/TVCG.2020.2981565" target="_blank" >10.1109/TVCG.2020.2981565</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    QuadStack: An Efficient Representation and Direct Rendering of Layered Datasets

  • Original language description

    We introduce QuadStack, a novel algorithm for volumetric data compression and direct rendering. Our algorithm exploits the data redundancy often found in layered datasets that are common in science and engineering fields such as geology, biology, mechanical engineering, medicine, etc. QuadStack first compresses the volumetric data into vertical stacks that are then compressed into a quadtree that identifies and represents the layered structures at the internal nodes. The associated data (color, material, density, etc.) and shape of these layer structures are decoupled and encoded independently, leading to high compression rates (4x to 45x) of the original voxel model memory footprint in our experiments). We also introduce an algorithm for value retrieving from the QuadStack representation and we show that the access has logarithmic complexity. Because of the fast access, QuadStack is suitable for efficient data representation and direct rendering and we show that our GPU implementation performs comparable in speed with the state-of-the-art algorithms (18-79 MRays/s in our implementation), while maintaining a significantly smaller memory footprint

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database

  • CEP classification

  • OECD FORD branch

    10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

    P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Others

  • Publication year

    2021

  • Confidentiality

    S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Data specific for result type

  • Name of the periodical

    IEEE Transactions on Visualization and Computer Graphics

  • ISSN

    1077-2626

  • e-ISSN

    1941-0506

  • Volume of the periodical

    27

  • Issue of the periodical within the volume

    9

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    12

  • Pages from-to

    3733-3744

  • UT code for WoS article

    000679532000010

  • EID of the result in the Scopus database

    2-s2.0-85111772911