2004
DOI: 10.1016/j.cag.2004.06.010
|View full text |Cite
|
Sign up to set email alerts
|

A refined data addressing and processing scheme to accelerate volume raycasting

Abstract: Most volume rendering systems based on CPU volume raycasting still suffer from inefficient CPU utilization and high memory usage. To target these issues we present a new technique for efficient data addressing. Furthermore, we introduce a new processing scheme for volume raycasting which exploits thread-level parallelism-a technology now supported by commodity computer architectures. r

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
12
0
1

Year Published

2006
2006
2016
2016

Publication Types

Select...
4
3
3

Relationship

1
9

Authors

Journals

citations
Cited by 25 publications
(13 citation statements)
references
References 10 publications
0
12
0
1
Order By: Relevance
“…A class of techniques exist, where spectral data properties are studied with the goal to estimate the optimal sampling step [Danskin and Hanrahan 1992;Stander and Hart 1994]. In others, hierarchical encoding [Levoy 1990a;Levoy 1990b;Ke and Chang 1993;Fung and Heng 1998;Feng Dong et al 2000], spectral representation [Totsuka and Levoy 1993;Malzbender 1993] or specialized data structures [Udupa and Odhner 1993;Lacroute and Levoy 1994;Parker et al 1998;Parker et al 1999;Grimm et al 2004] are used. Other techniques take advantage from segmentation of the volume in background and foreground.…”
Section: Dvr By Ray Castingmentioning
confidence: 99%
“…A class of techniques exist, where spectral data properties are studied with the goal to estimate the optimal sampling step [Danskin and Hanrahan 1992;Stander and Hart 1994]. In others, hierarchical encoding [Levoy 1990a;Levoy 1990b;Ke and Chang 1993;Fung and Heng 1998;Feng Dong et al 2000], spectral representation [Totsuka and Levoy 1993;Malzbender 1993] or specialized data structures [Udupa and Odhner 1993;Lacroute and Levoy 1994;Parker et al 1998;Parker et al 1999;Grimm et al 2004] are used. Other techniques take advantage from segmentation of the volume in background and foreground.…”
Section: Dvr By Ray Castingmentioning
confidence: 99%
“…Bricking on the CPU was used to improve cache coherency by Grimm et al [9]. Kähler et al [13] use a CPU based kd-tree on top of a bricking approach to render adaptive mesh refinement data.…”
Section: Related Workmentioning
confidence: 99%
“…This transfer is very time consuming, thus interactive feedback becomes problematic. In contrast, within a pure CPU based solution this transfer is unnecessary allowing more efficient processing of data (Grimm et al, 2004).…”
Section: Volume Rendering On the Cpumentioning
confidence: 99%