1998
DOI: 10.1016/s0167-8191(98)00063-5
|View full text |Cite
|
Sign up to set email alerts
|

Extensions to permutation warping for parallel volume rendering

Abstract: SIMD, MIMD, MasPar, volume visualization, parallel algorithmsBiomedical volume visualization requires high quality and high performance, but the existing high performance solutions such as the Shear Warp algorithm, 3D texture mapping, and special purpose hardware have problems.Permutation warping achieves high fidelity for biomedical datasets of regular rectilinear volumes, using a one-to-one communication scheme for optimal O(1) communication on massively parallel computers. Extensions are presented including… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2007
2007
2007
2007

Publication Types

Select...
1

Relationship

0
1

Authors

Journals

citations
Cited by 1 publication
(1 citation statement)
references
References 22 publications
(1 reference statement)
0
1
0
Order By: Relevance
“…In addition, volume datasets are too large to be stored in the memory of a single processor. One way to solve the above problems is to parallelize the serial volume rendering methods on distributed memory multicomputers [23][24][25][26][27][28][29].…”
Section: Introductionmentioning
confidence: 99%
“…In addition, volume datasets are too large to be stored in the memory of a single processor. One way to solve the above problems is to parallelize the serial volume rendering methods on distributed memory multicomputers [23][24][25][26][27][28][29].…”
Section: Introductionmentioning
confidence: 99%