Calculs de visibilité dans un environnement polygonal 2D

Stéphane Riviere 1
1 iMAGIS - Models, Algorithms and Geometry for Computer Generated Image Graphics
GRAVIR - IMAG - Graphisme, Vision et Robotique, Inria Grenoble - Rhône-Alpes
Abstract : The core part of computer programs such as visualization softwares, rendering engines or robotics path planners lies in visibly computations. Although the corresponding algorithms are only a small part of the whole application, they are responsible for most of the running time and their efficiency is therefore crucial. Traditional visibility computation algorithms have two drawbacks: They perform useless computations on invisible objects, and recompute everything from scratch for every single query, even if the changes undergone by two successive solutions are minor. We show how to remedy these problems in the context of polygonal scenes in the plane by using the visibility complex data structure, which encodes all the visibility relations between objects of the scene. First, we present an optimal algorithm for computing the visibility complex. Second, we show how to use this data structure to compute visibility polygons and to maintain views around a moving point in the scene. Both the theoretical complexity and the practical performances of our algorithms are presented. Finally, we explain how to handle the degeneracies and numerical imprecisions caused by real-world data sets.
Document type :
Complete list of metadatas
Contributor : Team Artis <>
Submitted on : Friday, November 12, 2010 - 5:30:00 PM
Last modification on : Wednesday, April 11, 2018 - 1:55:03 AM
Long-term archiving on : Sunday, February 13, 2011 - 2:27:26 AM


  • HAL Id : tel-00528854, version 1




Stéphane Riviere. Calculs de visibilité dans un environnement polygonal 2D. Interface homme-machine [cs.HC]. Université Joseph-Fourier - Grenoble I, 1997. Français. ⟨tel-00528854⟩



Record views


Files downloads