Temporally Coherent Conservative Visibility
Author(s)
Coorg, Satvan; Teller, Seth
DownloadMIT-LCS-TM-540.pdf (880.7Kb)
Metadata
Show full item recordAbstract
Efficiently identifying polygons that are visible from a changing synthetic viewpoint is an important problem in computer graphics. even with hardware support, simple algorithms like depth-buffering cannot achieve interactive frame rates when applied to geometric models with many polygons. However, a visibility algorithm that exploits the occlusion properties of the scene to identify a superset of visible polygons, without touching most invisible polygons, could achieve fast rates while viewing such models.
Date issued
1995-11Series/Report no.
MIT-LCS-TM-540