Speeding Up Isosurfacing: The Matryoshka Algorithm

Simple item page
dc.contributor.authorLopes, Sergioen_US
dc.contributor.authorLopes, Adrianoen_US
dc.contributor.authorSantos, M. Prospero dosen_US
dc.contributor.editorIk Soo Lim and David Duceen_US
dc.date.accessioned2014-01-31T19:58:09Z
dc.date.available2014-01-31T19:58:09Z
dc.date.issued2007en_US
dc.description.abstractWe 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.en_US
dc.description.seriesinformationTheory and Practice of Computer Graphicsen_US
dc.identifier.isbn978-3-905673-63-0en_US
dc.identifier.urihttps://doi.org/10.2312/LocalChapterEvents/TPCG/TPCG07/097-105en_US
dc.publisherThe Eurographics Associationen_US
dc.subjectCategories and Subject Descriptors (according to ACM CCS): I.3.3 [Computer Graphics]: Picture/Image Generation. I.3.6 [Computer Graphics]: Methodology and Techniques. I.3.7 [Computer Graphics]: Three-Dimensional Graphics and Realism.en_US
dc.titleSpeeding Up Isosurfacing: The Matryoshka Algorithmen_US
Files
Original bundle
Now showing 1 - 1 of 1
No Thumbnail Available
Name:
097-105.pdf
Size:
391.22 KB
Format:
Adobe Portable Document Format
Download
Collections
EG UK Theory and Practice of Computer Graphics 2007