Maintaining visibility information of planar point sets with a moving viewpoint
Given a set of n points in the plane, we consider the problem of
computing the circular ordering of the points about a viewpoint q and
efficiently maintaining this ordering information as q moves. The
algorithm equally applies to the ordering of the points according to their
distance to q.
Images and movies
BibTex references
@InProceedings\{DDEHWW05, author = "Devillers, Olivier and Dujmovi\ć, Vida and Everett, Hazel and Hornus, Samuel and Whitesides, Sue and Wismath, Stephen", title = "Maintaining visibility information of planar point sets with a moving viewpoint", booktitle = "17th Canadian Conference on Computational Geometry", year = "2005", url = "http://artis.inrialpes.fr/Publications/2005/DDEHWW05" }