Speeding Up Isosurfacing: The Matryoshka Algorithm
No Thumbnail Available
Date
2007
Journal Title
Journal ISSN
Volume Title
Publisher
The Eurographics Association
Abstract
We propose a hybrid algorithm for isosurface visualization that embraces both polygon rendering and direct surface rendering concepts. It uses raytracing to achieve high image quality but avoids the associated empty ray traversal. At the heart of the algorithm is a caching strategy resembling the famous Russian stacking dolls, that allows the processing of cells of interest from any viewing orientation. We use an optimised interval tree to extract these cells from the volume. In that respect, we propose two versions, combining grouping of cells and ordering. In comparison to the classic version of the interval tree, the memory overhead decreases but the increasing in the query time is marginal.
Description
@inproceedings{:10.2312/LocalChapterEvents/TPCG/TPCG07/097-105,
booktitle = {Theory and Practice of Computer Graphics},
editor = {Ik Soo Lim and David Duce},
title = {{Speeding Up Isosurfacing: The Matryoshka Algorithm}},
author = {Lopes, Sergio and Lopes, Adriano and Santos, M. Prospero dos},
year = {2007},
publisher = {The Eurographics Association},
ISBN = {978-3-905673-63-0},
DOI = {/10.2312/LocalChapterEvents/TPCG/TPCG07/097-105}
}