The corner arc algorithm

In a landmark survey of visibility algorithms in 1974, Sutherland, Sproull, and Schumacker stated that “We believe the principal untapped source of help for hidden surface algorithms lies in frame and object coherence.” [11] 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.” [3] This five minute video describes a kinetic visibility algorithm for moving objects in the plane that is provably efficient in an average case setting. The corner arc algorithm is a Kinetic Data Structure [2] which makes use of new properties of pseudo-triangulations [9]. The corner arc algorithm and its analysis are given in Chapters 4 and 5 of a thesis on kinetic visibility algorithms [6] where the proofs and more detail for the theorems in this are found.

• Type: Conference
• Year: 2004
• Where: COMPGEOM
• Authors: Olaf A. Hall-Holt
• Keywords: COMPGEOM 2004, Corner Arc Algorithm, Kinetic Visibility Algorithms, Visibility Algorithms