A Simple Kinetic Visibility Polygon
Given a set of moving obstacles in the plane, we propose a method for
maintaining efficiently the visibility polygon of a (possibly moving)
viewpoint. We consider both smooth-convex, and simply-polygonal obstacles.
Images and movies
BibTex references
@InProceedings\{HP02, author = "Hornus, Samuel and Puech, Claude", title = "A Simple Kinetic Visibility Polygon", booktitle = "18th European Workshop on Computational Geometry", pages = "27-30", year = "2002", note = "Warsaw Uni", keywords = "kinetic data structures, visibility", url = "http://artis.inrialpes.fr/Publications/2002/HP02" }