Skip to Main content Skip to Navigation
Conference papers

A Simple Kinetic Visibility Polygon

Samuel Hornus Claude Puech 1
1 iMAGIS - Models, Algorithms and Geometry for Computer Generated Image Graphics
GRAVIR - IMAG - Laboratoire d'informatique GRAphique, VIsion et Robotique de Grenoble, Inria Grenoble - Rhône-Alpes
Abstract : 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.
Document type :
Conference papers
Complete list of metadata


https://hal.inria.fr/inria-00510032
Contributor : Team Evasion Connect in order to contact the contributor
Submitted on : Tuesday, August 17, 2010 - 3:05:46 PM
Last modification on : Monday, December 28, 2020 - 3:44:02 PM
Long-term archiving on: : Thursday, November 18, 2010 - 2:56:17 AM

Files

vispoly.pdf
Files produced by the author(s)

Identifiers

  • HAL Id : inria-00510032, version 1

Collections

INRIA | IMAG | CNRS | UGA

Citation

Samuel Hornus, Claude Puech. A Simple Kinetic Visibility Polygon. 18th European Workshop on Computational Geometry, 2002, Varsovie, Poland. pp.27-30. ⟨inria-00510032⟩

Share

Metrics

Record views

264

Files downloads

319