Time/Space Tradeoffs for Polygon Mesh Rendering

ACM Transactions on Graphics

Volumn 15, Issue 2, 1996, Pages 141-152

  Bar Yehuda, Reuven ^a   Gotsman, Craig ^a  

^a TECHNION ISRAEL INSTITUTE OF TECHNOLOGY   (Israel)

Author keywords

Algorithms; G.2.2 Discrete Mathematics : Graph Theory graph algorithms; Graphics pipeline; I.3.1 Computer Graphics : Hardware Architecture graphics processors; raster display devices; Polygons; Rendering

Indexed keywords

ALGORITHMS; APPROXIMATION THEORY; COMPUTATIONAL GEOMETRY; COMPUTER ARCHITECTURE; COMPUTER HARDWARE; DISPLAY DEVICES; GRAPH THEORY; PIPELINE PROCESSING SYSTEMS;

POLYGON MESH RENDERING; RENDERING; RENDERING SEQUENCE; TIME SPACE TRADEOFFS; TRIANGLE MESHES; VORTEX;

COMPUTER GRAPHICS;

EID: 0030121105     PISSN: 07300301     EISSN: None     Source Type: Journal    
DOI: 10.1145/234972.234976     Document Type: Article

References (15)

1. AKELEY, K., HAEBERLI, P., AND BURNS, D. 1990. C program on SGI machines in /usr/people/ 4Dgifts/iristools/libgutil/tomesh.c.
2. ARKIN, E. M., HELD, M., MITCHELL, J. S. B., AND SKIENA, S. S. 1994. Hamiltonian triangulations for fast rendering. In Algorithms - ESA '94, LNCS 855 (Utrecht, NL, Sept.), J. van Leeuwen, Ed., 36-47.
3. CASSIDY, R., GREGG, E., REEVES, R., AND TURMELLE, J. 1991. IGL: The Graphics Library for the i860.
4. CHUNG, F. R. K. AND YAU, S. T. 1994. A near optimal algorithm for edge separators. In Proceedings of the 26th Annual ACM Symposium on the Theory of Computing (Montreal, Que., May), ACM, New York, 1-8.
5. DEERING, M. 1995. Geometry compression. Comput. Graph. (Proc. SIGGRAPH), 29, 13-20.
6. DJIDJEV, H. N. 1982. On the problem of partitioning planar graphs. SIAM J. Alg. Disc. Meth. 3, 2, 229-240.
7. GARG, N., SARAN, H., AND VAZIRANI, V. V. 1994. Finding separator cuts in planar graphs within twice the optimal. In Proceedings of the 35th Annual Symposium on Foundations of Computer Science (Santa Pe, NM, Nov.), IEEE Computer Society Press, 14-23.
8. GAZIT, H. 1994. An algorithm for finding & 7/3√n separator in planar graphs. Preprint.
9. LEIGHTON, T. AND RAO, S. 1988. An approximate max-flow nun-cut theorem for uniform multicommodity flow problems with applications to approximation algorithms. In Proceedings of the 29th Annual Symposium on Foundations of Computer Science (White Plains, NY, Oct.), IEEE Computer Society Press, 256-269.
10. LIPTON, R. J. AND TARJAN, R. E. 1979. A separator theorem for planar graphs. SIAM J. Appl. Math., 36, 2, 177-189.
11. NEIDER, J., DAVIS, T., AND MASON, W. 1994. OpenGL Programming Guide. Addison-Wesley, Reading, MA.
12. PARK, J. K. AND PHILLIPS, C. A. 1993. Finding minimum-quotient cuts in planar graphs. In Proceedings of the 25th Annual ACM Symposium on the Theory of Computing (San Diego, CA, May), ACM, New York, 766-775.
13. PREPARATA, F. P. AND SHAMOS, M. I. 1985. Computational Geometry: An Introduction. Springer-Verlag, New York.
14. RAO, S. B. 1992. Faster algorithms for finding small edge cuts in planar graphs. In Proceedings of the 24th Annual ACM Symposium on the Theory of Computing (Victoria, BC, May), ACM, New York, 229-240.
15. SILICON GRAPHICS INC. 1991. GL Programming Guide.