Time and Space Optimal Data Parallel Volume Rendering Using Permutation Warping

@article{Wittenbrink1997TimeAS,
  title={Time and Space Optimal Data Parallel Volume Rendering Using Permutation Warping},
  author={Craig M. Wittenbrink and Arun K. Somani},
  journal={J. Parallel Distrib. Comput.},
  year={1997},
  volume={46},
  pages={148-164}
}
In this paper we present a data parallel volume rendering algorithm that possesses numerous advantages over prior published solutions. Volume rendering is a three-dimensional graphics rendering algorithm that computes views of sampled medical and simulation data, but has been much slower than other graphics algorithms because of the data set sizes and the computational complexity. Our algorithm uses permutation warpingto achieve linear speedup (run time is O(S/P) for P processors whenP = O(S… CONTINUE READING

Citations

Publications citing this paper.
SHOWING 1-10 OF 14 CITATIONS

References

Publications referenced by this paper.
SHOWING 1-10 OF 40 REFERENCES

K.Digital Image Processing

  • W. Pratt
  • 1978
Highly Influential
3 Excerpts

Similar Papers

Loading similar papers…