A Characterization of Ten Hidden-Surface Algorithms
ACM Computing Surveys (CSUR)
Raster-scan hidden surface algorithm techniques
SIGGRAPH '77 Proceedings of the 4th annual conference on Computer graphics and interactive techniques
A characterization of ten rasterization techniques
SIGGRAPH '89 Proceedings of the 16th annual conference on Computer graphics and interactive techniques
Parallel object-space hidden surface removal
SIGGRAPH '90 Proceedings of the 17th annual conference on Computer graphics and interactive techniques
A task adaptive parallel graphics renderer
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
A multicomputer polygon rendering algorithm for interactive applications
PRS '93 Proceedings of the 1993 symposium on Parallel rendering
A New Algorithm for Interactive Graphics on Multicomputers
IEEE Computer Graphics and Applications
Dynamic Load Balancing for Parallel Polygon Rendering
IEEE Computer Graphics and Applications
Load balancing for multi-projector rendering systems
HWWS '99 Proceedings of the ACM SIGGRAPH/EUROGRAPHICS workshop on Graphics hardware
Fast image generation of construcitve solid geometry using a cellular array processor
SIGGRAPH '85 Proceedings of the 12th annual conference on Computer graphics and interactive techniques
Parallel processing image synthesis and anti-aliasing
SIGGRAPH '81 Proceedings of the 8th annual conference on Computer graphics and interactive techniques
Dynamic scan-converted images with a frame buffer display device
SIGGRAPH '80 Proceedings of the 7th annual conference on Computer graphics and interactive techniques
A parallel processor system for three-dimensional color graphics
SIGGRAPH '84 Proceedings of the 11th annual conference on Computer graphics and interactive techniques
An O(log N) parallel time exact hidden-line algorithm
EGGH'87 Proceedings of the Second Eurographics conference on Advances in Computer Graphics Hardware
| Hi-index | 0.00 |
Previous work in the hidden-surface problem has revealed two key concepts. First, the removal of non-visible surfaces is essentially a sorting problem. Second, some form of coherence is essential for the efficient solution of this problem. In order to provide real-time simulations, it is not only the amount of sorting which must be reduced, but the total time required for computation. One potentially economic strategy to attain this goal is the use of parallel processor systems. This approach implies that the computational time will no longer be dependent on the total amount of sorting, but more on the appropriate division of responsibility. This paper investigates two existing algorithmic approaches to the hidden-surface problem with a view towards their applicability to implementation on a parallel machine organization. In particular, the statistical results of a parallel processor implementation indicate the difficulties stemming from a loss of coherence and imply potentially important design criteria for a parallel configuration.