Open Access
A New Parallel Volume Rendering Algorithm.
Chin Hyun Chung,R. S. Ramakrishna +1 more
- 01 Jan 2001
- pp 32-37
TL;DR: On screen division of objects for parallel volume rendering is considered and the notable characteristic of the algorithm is that it effects data transfers only when it is absolutely necessary.
read more
Abstract: On screen division of objects for parallel volume rendering is considered in this paper. The suggested
algorithm runs on private-memory based parallel computers. The notable characteristic of the algorithm is
that it effects data transfers only when it is absolutely necessary.
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
References
Direct volume rendering with shading via three-dimensional textures
Allen Van Gelder,Kwansik Kim +1 more
- 01 Oct 1996
TL;DR: A new and easy-to-implement method for direct volume rendering that uses 3D texture maps for acceleration, and incorporates directional lighting, is described, and compares it to the shear-warp factorization approach.
A survey of architectures for volume rendering
TL;DR: Five hardware architectures for volume rendering, which requires efficiently handling a huge amount of volumetric data, are surveyed, categorized, and compared.
52
Parallel volume rendering on a network of workstations
C. Giersten,J. Petersen +1 more
TL;DR: An algorithm for parallel volume rendering on general-purpose workstations connected to a local area network (LAN) is presented and it is concluded that minimal additional computing and communication are required if each processor is given the task of computing sequences of successive lines in the image.
48
Exploiting deep parallel memory hierarchies for ray casting volume rendering
Michael E. Palmer,Stephen Taylor,Brian Totty +2 more
- 20 Oct 1997
TL;DR: Techniques to efficiently exploit all levels of the deep memory hierarchy of a distributed Power Challenge Array, on which a logical global address space for volume blocks with caching is implemented, allow to efficiently render a 7.1 GByte dataset.
15
A scalable MIMD volume rendering algorithm
Craig M. Wittenbrink,M. Harrington +1 more
- 01 Apr 1994
TL;DR: The efficiency results from nonconflicting communication, a permutation warp, that remains efficient with larger data sets, larger parallel machines, and high order filters showing scalability can be achieved through object space partitioning.
15