Share Email Print
cover

Proceedings Paper

Optimized and load-balanced portable parallel Zbuffer
Author(s): Henri-Pierre Charles; Laurent Lefevre; Serge Miguet
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

This paper describes the parallel implementation of the Zbuffer algorithm on different kinds of distributed memory machines. In computer graphics domain, the Zbuffer is one of the most popular and fastest techniques to generate a surfacic representation of a scene consisting of objects in a 3-dimensional world. To improve this method we develop a parallel algorithm which uses a hypercube topology, load-balancing techniques and portable global communications phases.

Paper Details

Date Published: 7 April 1995
PDF: 10 pages
Proc. SPIE 2410, Visual Data Exploration and Analysis II, (7 April 1995); doi: 10.1117/12.205973
Show Author Affiliations
Henri-Pierre Charles, Ecole Normale Superieure de Lyon (France)
Laurent Lefevre, Ecole Normale Superieure de Lyon (France)
Serge Miguet, Ecole Normale Superieure de Lyon (France)


Published in SPIE Proceedings Vol. 2410:
Visual Data Exploration and Analysis II
Richard N. Ellson; Georges G. Grinstein; Robert F. Erbacher, Editor(s)

© SPIE. Terms of Use
Back to Top