Dynamic visibility in polygonal scenes with the visibility complex
SCG '97 Proceedings of the thirteenth annual symposium on Computational geometry
Data structures for mobile data
Journal of Algorithms
A Characterization of Ten Hidden-Surface Algorithms
ACM Computing Surveys (CSUR)
Frame-to-frame coherence and the hidden surface computation: constraints for a convex world
ACM Transactions on Graphics (TOG)
Kinetic visibility
| Hi-index | 0.00 |
In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that "We believe the principal untappedsource of help for hidden surface algorithms lies in frame and object coherence." Making use of such temporal coherence appears to be difficult, however, for scenes with moving objects. Almost three decades later Cohen-Or, Chrysanthou, and Silva stated that "The efficient handing of dynamic scenes is an open area of research at this point." This five minute video describes a kinetic visibility algorithm formoving objects in the plane that is provably efficient in an average case setting.