An efficient algorithm for hidden surface removal

Proceedings of the 16th Annual Conference on Computer Graphics and Interactive Techniques, SIGGRAPH 1989

Volumn , Issue , 1989, Pages 379-388

  Mulmuley, Ketan ^a  

^a UNIVERSITY OF CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTER GRAPHICS;

DEPTH COMPLEXITY; EXPECTED TIME; HIDDEN SURFACE REMOVAL; HIDDEN SURFACE REMOVAL ALGORITHM; TIME COMPLEXITY;

INTERACTIVE COMPUTER GRAPHICS;

EID: 84976840946     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/74333.74372     Document Type: Conference Paper

References (17)

1. [Be] Ben-Or M., "Lower bounds for algebraic computation tres", Proc. of the 15th STOC, 83.
2. [CE] Chazelle B., Edelsbrnnner I-I., "An optimal algorithm for intersecting line segments in the plane", Proceedings of the FOCS, 1988.
3. [Cl] Clarkson K., "Applications of random sampling to computational geometry, II", Pro, . $th Ann. A CM Symposium on Computational Geom., 1988.
4. [CS] Clarkson K., Shot P., "Algorithms for diametral pairs and convex hulls that are optimal, randomized, and incremental", Pro, . Sth Ann. ACM Symposium on Computational Geometry, 1988.
5. [HG] Itamlin G., Gear C., "Raster-Scan hidden surface algorithm techniques", Computer Graphics, vol. 11, no. 2, pp. 206-213.
6. [HW] Haussler D., Welzl E., "Epsilon nets and simplex range queries", Proc. 2nd Ann. ACM Symposium on Computational Geometry, 86.
7. [Mc] Mckenna M., "Worst-case optimal hidden surface removal algorithm", ACM transactions on graphics, vol.6, no. 1, 1987.
8. [Mull Mulmuley K., "A fast planar partition algorithm, I", Proceedings of the 29th FOCS, 1988, full version to appear in a special computational geometry issue off the Journal of Symb. Logic.
9. [Mu2] Mulmuley K., "A fast planar partition algorithm, II", To appear in the Proceedings of the 5th Ann. ACM symposium on Computational Geometry, 89, full version submitted to JACM.
10. [Mu3] Mulmuley K., "On levels in arrangements and Voronoi diagrams", Technical report, TR 88-21, University of Chicago, December, 88, submitted to the Journal of Discrete and Computational Geom.
11. [Mu4] Mulmuley K., "An efficient algorithm for hidden surface removal, I', a complete manuscript.
12. [Mu5] Mulmuley K., "An efficient algorithm for hidden surface removal, II", in preparation.
13. [NSS] Newell M., Newell R., San, ha T., "A new approach to the shaded picture problem", Proc. ACM. National Conf., 1972.
14. [Sc] Schmltt A. "Time and space bounds for hidden line and hidden surface Mgortithms', Eurographics, 81.
15. [Sut] Sutherland, I. E., R. F. Sproull, and R. A. Schumaker, "A characterization of ten hidden surface algorithms", Computing Surveys 6: 1-55, 1974.
16. [Wa] Warnock J., "A hidden surface algorithm for computer generated half-Tone pictures", computer science dept., University of Utah, TR 4-15, 1969.
17. [WA] Weiler K., Atherton P., "Hidden surface removal using polygon area sorting", computer graphics (Pro, . SIGGRAPtt), July, 77.