Parallel object-space hidden surface removal
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
Multiprocessor methods for computer graphics rendering
Multiprocessor methods for computer graphics rendering
PixelFlow: high-speed rendering using image composition
SIGGRAPH '92 Proceedings of the 19th annual conference on Computer graphics and interactive techniques
A MIMD rendering algorithm for distributed memory architectures
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
Exploiting Coherence for Multiprocessor Ray Tracing
IEEE Computer Graphics and Applications
A parallel scan conversion algorithm with anti-aliasing for a general-purpose ultracomputer
SIGGRAPH '83 Proceedings of the 10th annual conference on Computer graphics and interactive techniques
Parallel processing techniques for hidden surface removal
SIGGRAPH '79 Proceedings of the 6th annual conference on Computer graphics and interactive techniques
Animac: a multiprocessor architecture for real-time computer animation (graphics, shadows, vlsi)
Animac: a multiprocessor architecture for real-time computer animation (graphics, shadows, vlsi)
Parallel image generation with anti-aliasing and texturing
Parallel image generation with anti-aliasing and texturing
A Sorting Classification of Parallel Rendering
IEEE Computer Graphics and Applications
A New Algorithm for Interactive Graphics on Multicomputers
IEEE Computer Graphics and Applications
The sort-first rendering architecture for high-performance graphics
I3D '95 Proceedings of the 1995 symposium on Interactive 3D graphics
Image composition methods for sort-last polygon rendering on 2-D mesh architectures
PRS '95 Proceedings of the IEEE symposium on Parallel rendering
Load balancing for multi-projector rendering systems
HWWS '99 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Hybrid sort-first and sort-last parallel rendering with a cluster of PCs
HWWS '00 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Scalable parallel algorithms for interactive visualization of curved surfaces
Supercomputing '96 Proceedings of the 1996 ACM/IEEE conference on Supercomputing
Adaptive Parallel Rendering on Multiprocessors and Workstation Clusters
IEEE Transactions on Parallel and Distributed Systems
Image Composition Schemes for Sort-Last Polygon Rendering on 2D Mesh Multicomputers
IEEE Transactions on Visualization and Computer Graphics
Review: Large scale distributed visualization on computational Grids: A review
Computers and Electrical Engineering
Revisiting parallel rendering for shared memory machines
EG PGV'11 Proceedings of the 11th Eurographics conference on Parallel Graphics and Visualization
Optimal static 2-dimensional screen subdivision for parallel rasterization architectures
EGGH'96 Proceedings of the Eleventh Eurographics conference on Graphics Hardware
| Hi-index | 0.00 |
Using parallel processing for visualization speeds up computer graphics rendering of complex data sets. A parallel algorithm designed for polygon scan conversion and rendering is presented which supports fast rendering of highly complex data sets using advanced lighting models. Dedicated graphics rendering engines do not necessarily suit such data sets, although they can support real-time update of moderately complex scenes using simple lighting. Advantages to using a software-based approach include the feasibility of adding special rendering features to the program and the capability of integrating a parallel scientific application with a parallel graphics renderer. A new work decomposition strategy presented, called task adaptive, is based on dynamically partitioning the amount of computational work left at a given time. The algorithm uses a heuristic for dynamic task decomposition in which image space tasks are partitioned without requiring interruption of the partitioned processor. A sophisticated memory referencing strategy lets local memory access graphics data during rendering. This permits implementation of the algorithm on a distributed memory multiprocessor. An in-depth analysis of the overhead costs accompanying parallel processing shows where performance is adequate or could be improved.