A lower bound for randomized algebraic decision trees

D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, R. Smolensky, in: Proc. of 28th ACM-STOC, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–621.

Download
No fulltext has been uploaded.
Conference Paper | English
Author
; ; ;
Abstract
We present a parallel algorithm for the rendering of complex three-dimensional scenes. The algorithm runs across heterogeneous architectures of PC-clusters consisting of a visualization-node, equipped with a powerful graphics adapter, and cluster nodes requiring weaker graphics capabilities only. The visualization-node renders a mixture of scene objects and simplified meshes (Reliefboards). The cluster nodes assist the visualization-node by asynchronous computing of Reliefboards, which are used to replace and render distant parts of the scene. Our algorithm is capable of gaining significant speedups if the cluster's nodes provide weak graphics adapters only. We trade the number of cluster nodes off the scene objects' image quality.
Publishing Year
Proceedings Title
Proc. of 28th ACM-STOC
Volume
65453
Page
612-621
LibreCat-ID

Cite this

Grigoriev D, Karpinski M, Meyer auf der Heide F, Smolensky R. A lower bound for randomized algebraic decision trees. In: Proc. of 28th ACM-STOC. Vol 65453. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization; 1996:612-621.
Grigoriev, D., Karpinski, M., Meyer auf der Heide, F., & Smolensky, R. (1996). A lower bound for randomized algebraic decision trees. In Proc. of 28th ACM-STOC (Vol. 65453, pp. 612–621). Eurographics Symposium on Parallel Graphics and Visualization.
@inproceedings{Grigoriev_Karpinski_Meyer auf der Heide_Smolensky_1996, series={Lecture Notes in Computer Science}, title={A lower bound for randomized algebraic decision trees}, volume={65453}, booktitle={Proc. of 28th ACM-STOC}, publisher={Eurographics Symposium on Parallel Graphics and Visualization}, author={Grigoriev, Dima and Karpinski, Marek and Meyer auf der Heide, Friedhelm and Smolensky, Roman}, year={1996}, pages={612–621}, collection={Lecture Notes in Computer Science} }
Grigoriev, Dima, Marek Karpinski, Friedhelm Meyer auf der Heide, and Roman Smolensky. “A Lower Bound for Randomized Algebraic Decision Trees.” In Proc. of 28th ACM-STOC, 65453:612–21. Lecture Notes in Computer Science. Eurographics Symposium on Parallel Graphics and Visualization, 1996.
D. Grigoriev, M. Karpinski, F. Meyer auf der Heide, and R. Smolensky, “A lower bound for randomized algebraic decision trees,” in Proc. of 28th ACM-STOC, 1996, vol. 65453, pp. 612–621.
Grigoriev, Dima, et al. “A Lower Bound for Randomized Algebraic Decision Trees.” Proc. of 28th ACM-STOC, vol. 65453, Eurographics Symposium on Parallel Graphics and Visualization, 1996, pp. 612–21.

Export

Marked Publications

Open Data LibreCat

Search this title in

Google Scholar