SIMD algorithms for image rendering
A parameterized cast model for SIMD machines is developed and used to rank projective image rendering algorithms. The ranking considers such an extremely broad range of remote communication costs that it holds for all practical situations. Ranked first is a new projective algorithm presented in the thesis. Empirical results support the ranking developed from the analytic models. The cost model is also applied to ray tracing, so that precomputed approximate sorts of surface primitives can be rigorously used to speed parallel ray tracing. The general-purpose architecture assumption is justified by showing that special-purpose machines actually render images more slowly. The author conjectures that neither SIMD nor MIMD architectures have a fundamental advantage when efficient algorithms are known for both machine types. The algorithms and analysis presented can serve as a model for SIMD computations in other applications domains.
- Research Organization:
- Harvard Univ., Boston, MA (USA)
- OSTI ID:
- 6046622
- Resource Relation:
- Other Information: Thesis (Ph. D.)
- Country of Publication:
- United States
- Language:
- English
Similar Records
Parallel architectures and parallel algorithms for integrated vision systems
Algorithms for parallel polygon rendering