An efficient parallel algorithm or visible-surface detection in 3d graphics display

References

• Ajjanagadde , V.G. and Patnaik , L.M . 1988 . Design and performance evaluation of a systolic architecture for hidden-surface removal . Computers and Graphics , 12 ( 1 ) : 71 – 74 .
   Web of Science ®Google Scholar
• Berg , De . 1995 . “ Generalized hidden surface removal ” . In CGTA: Computational Geometry: Theory and Applications Vol. 5 ,
   Google Scholar
• Catmull , E. Computer display of curved surfaces . Proc. IEEE Conf. on Computer Graphics Pattern Recognition and Data Structures . pp. 309 – 315 .
   Google Scholar
• Chang , P. and Jain , Ramesh . 1981 . A multi-processor system for hidden-surface-removal . Computer Graphics , 15 ( 4 ) December : 405 – 436 .
   Google Scholar
• Das , S.R. , Vaidya , N.H. and Patnaik , L.M. 1990 . A systolic algorithm for hidden surface removal . Parallel Computing , 15 ( 1-3 ) September : 277 – 289 .
   Web of Science ®Google Scholar
• Foley , J.D. , Van Dam , A. , Feiner , S.K. and Hughes , J.F. 1995 . Computer Graphics: Principles and Practice , Addison-Wesley .
   Google Scholar
• Randolph Franklin , W. and Mohan , S. 1990 . Parallel object-space hidden surface removal , 24 August : 87 – 94 .
   Google Scholar
• Frieder , O. Dynamic detection of hidden-surfaces using a MIMD multiprocessor . Proceedings of Third Annual IEEE Symposium on Computer-Based Medical Systems . pp. 44 – 51 .
   Google Scholar
• Giloi , W.K. 1978 . Interactive Computer Graphics — Data Structures, Algorithms, Languages , Englewood Cliffs : Prentice-Hall .
   Google Scholar
• Gustafson , J.L. 1988 . Reevaluating amdahl's lay . Communications of the ACM , 31 : 532 – 533 .
   Web of Science ®Google Scholar
• Heal , B. 1989 . Hidden octree removal . Computer Graphics Forum , 8 ( 3 ) : 199 – 206 .
   Google Scholar
• Hearn , D. and Baker , M.P. 1994 . Computer Graphics , Prentice-Hall .
   Google Scholar
• Highfield , J. and Bez , H.E. 1992 . Hidden surface elimination on parallel processors . Computer Graphics Forum , 11 ( 5 ) : 293 – 307 .
   Google Scholar
• Jájá , J. 1992 . Introcduction to Parallel Algorithms , Addison-Wesley .
   Google Scholar
• Donald , P. 1979 . Parallel processing techniques for hidden surface removal , 13 August : 300 – 307 .
   Google Scholar
• Shankar and Manocha , Dinesh . November 1994 . Hidden surface removal algorithms for curved surfaces , Vol. 22 , November , University of North Carolina — Chapel Hill . Technical Report TR94-063,Department of Computer Science
   Google Scholar
• Kumar , V. , Grama , A. , Gupta , A. and Karypis , G. 1994 . Introduction to Parallel Computing — Design and Analysis of Algorithms , Benjamin/Cummings .
   Google Scholar
• Kumar , V. and Singh , V. 1991 . Scalability of parallel algorithms for the all-pairs shortest path problem . J. Parallel and Distributed Computing , October : 124 – 138 .
   Google Scholar
• McKenna , Michael . 1987 . Worst-case optimal hidden-surface removal . ACM Transactions on Graphics , 6 ( 1 ) January : 19 – 28 .
   Web of Science ®Google Scholar
• Mulmuley , K. 1991 . Hidden surface removal with respect to a moving point . Proc. STOC , 6 ( 1 ) January : 512 – 522 .
   Google Scholar
• Mulmuley , Ketan . 1989 . strong an efficient algorithm for hidden surface removal/strong . Computer Graphics , 23 ( 3 ) July
   Google Scholar
• Mulmuley , Ketan . October 1990 . An efficient algorithm for hidden surface removal II , October , University of Chicago . Technical Report TR-90-31.Department of Computer Science,1995 22:05:46 GMT Thu, 30 Nov
   Google Scholar
• Marc , H. Overmars . Spheres, molecules, and hidden surface removal . Proceedings of the Tenth Annual Symposium on Computational Geometry, Stony Brook . New York. pp. 113 – 122 . ACM
   Google Scholar
• Pellegrini , Marco . 1996 . Repetitive hidden surface removal for polyhedra . Journal of Algorithms , 21 ( 1 ) July : 80 – 101 .
   Web of Science ®Google Scholar
• Scopigno , R. , Guerrini , S. and Rumolo , G. 1993 . Parallel depth-merge: a paradigm for hidden surface removal . Computers and Graphics , 17 ( 5 ) July : 583 – 592 .
   Web of Science ®Google Scholar
• Stytz , M.R. Experience using a dynamic adaptive hidden-surface removal algorithm for volume rendering within a MIMD architecture . Proceedings of the 5th Jerusalem Conference on Information Technology (JOT) . pp. 665 – 676 .
   Google Scholar
• Sun , X.H. and Rover , D.T. 1994 . Scalability of parallel algorithm-machine combinations . IEEE Trans. Parallel and Distributed Computing Systems , June : 599 – 613 .
   Google Scholar
• Sutherland , I.E. , Sproull , R.F. and Schumacker , R.A. 1974 . A characterization of ten hidden-surface algorithms . ACM Computing Surveys , 6 ( 1 ) March : 1 – 5 .
   Google Scholar
• Whitman , Scott and Parent , Richard . A survey of parallel hidden surface removal algorithms . Proceedings of PIXIM . Vol. 88 ,
   Google Scholar
• Zorbas , J.R. “ Measuring the scalability of parallel computer systems ” . In Proc.Super-computing , Vol. 89 , 831 – 841 . ACM Press . etal
   Google Scholar