Time/space tradeoffs for polygon mesh rendering
- 1 April 1996
- journal article
- Published by Association for Computing Machinery (ACM) in ACM Transactions on Graphics
- Vol. 15 (2) , 141-152
- https://doi.org/10.1145/234972.234976
Abstract
No abstract availableThis publication has 6 references indexed in Scilit:
- Finding separator cuts in planar graphs within twice the optimalPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- Geometry compressionPublished by Association for Computing Machinery (ACM) ,1995
- Hamiltonian triangulations for fast renderingPublished by Springer Nature ,1994
- Computational GeometryPublished by Springer Nature ,1985
- On the Problem of Partitioning Planar GraphsSIAM Journal on Algebraic Discrete Methods, 1982
- A Separator Theorem for Planar GraphsSIAM Journal on Applied Mathematics, 1979