An efficient output-sensitive hidden-surface removal algorithm and its parallelization

Proceedings of the 4th Annual Symposium on Computational Geometry, SCG 1988

Volumn , Issue , 1988, Pages 193-200

  Reif, John H ^a   Sen, Sandeep ^a  

^a DUKE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL GEOMETRY; OPTIMIZATION;

EFFICIENT OUTPUTS; HIDDEN SURFACE REMOVAL; HIDDEN SURFACE REMOVAL ALGORITHM; OPTIMAL ALGORITHM; PARALLELIZATIONS; POLYHEDRAL SURFACE; TIME COMPLEXITY; VISIBLE IMAGE;

COMPUTATIONAL COMPLEXITY;

EID: 84990681916     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/73393.73413     Document Type: Conference Paper

References (17)

1. Chazelle B. and Guibas L.N., "Visibility and Intersection Problems in Plane geometry," Proc. ACM Symp.on Computational geometry, 1985, pp. 135-146.
2. Mehlhorn K. and Naher S., "Dynamic Fractional cascading,".
3. Cole R. and Sharir M., Visibility problems for polyhedral terrains," Tech. Rept. No. 92, Courant Institute of Math. Sc., Dec, 1986.
4. Mehlhorn K: "Data Structures and Algorithms," Springer Publ. Comp, 1984a) Vol. 1: Sorting and Searching b) Vol. 3: Multidimensional Searching and Computational Geometry.
5. Preparata F. and Shamos I., "Computational Geometry: an introduction," Springer Publ, 1985.
6. Chazelle B., "A Theorem on Polygon Cutting with Applications," Proc. of IEEE FOCS 1982, pp. 339-349.
7. McKenna M., "Worst-case optimal hidden-surface removal," Tech. Rept JHU/EECS-86/05.
8. Wright T.J., "A Two-space solution to the hidden line problem for plotting functions of two variables," IEEE Trans. on Comput., vol. c-32, no. 1, pp. 28-33.
9. Lee D.T. and Preparata F.P., "Location of a point in a planar subdivision and its applications, SIAM Journal of Comput., 6(3), 1977, pp. 594-606.
10. Preparata F.P., "An optimal real time algorithm for planar convex hulls," Comm. of the ACM, 22, 1979, pp. 402-405.
11. Chazelle B. and Dobkin D., "Intersection of Convex Objects in Two and Three Dimensions," JACM, vol 34, Jan 1987, pp 1-27.
12. Mehlhorn K., "Arbitrary weight changes in Dynamic trees," Theoretical Informatics, vol 15, 1981, pp 183-211.
13. Nurmi O., "A fast line-sweep algorithm for hidden line elimination," BIT, vol 25, 1985, pp 466-472.
14. Schmitt A., "Time and Space bounds for hidden line and hidden surface elimination algorithms," EUROGRAPHICS '81, pp 43-56.
15. Goodrich M.T., "A polygonal approach to hidden-line elimination," Tech Rept 87-18, Dept of Computer Science, Johns Hopkins University.
16. Atallah M.J., Cole R. & Goodrich M.T., "Cascading Divide-and-Conquer: A technique for Designing Parallel Algorithms," Proc. of the 28th Annual Symp. on FOCS, 1987, pp. 151-160.
17. Sutherland I.E., Sproull R.F. & Schumacker R.A., "A Characterization of Ten Hidden-Surface Algorithms," Computing Surveys vol 6, no.1, March 1974, pp. 1-25.