Temporally Coherent Conservative Visibility
Name
MIT-LCS-TM-540.pdf
Size
880.79 KB
Format
Adobe PDF
Checksum (MD5)
1cb614f2872ca56495f47de9d448c13b
Author(s)
Coorg, Satvan
Teller, Seth
Date Issued
November 1995
Series/Report no.
MIT-LCS-TM-540
Abstract
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.
Persistent DSpace Link
