A Simple Kinetic Visibility Polygon

Samuel Hornus, Claude P. Puech · 2002

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.

Read the paper · More papers on PaperTik