2D and 3D Visibility in Discrete Geometry : an Application to Discrete Geodesic Paths

David Coeurjolly (1) , S. Miguet (1) , Laure Tougne (1)

1 LIRIS - Laboratoire d'InfoRmatique en Image et Systèmes d'information

In this article, we present a discrete definition of the classical visibility in computational geometry based on digital straight lines. We present efficient algorithms to compute the set of pixels in a non-convex domain that are visible from a source pixel. Based on these definitions, we define discrete geodesic paths in discrete domain with obstacles. This allows us to introduce a new geodesic metric in discrete geometry.

Domaines: Traitement des images [eess.IV]

David Coeurjolly, S. Miguet, Laure Tougne. 2D and 3D Visibility in Discrete Geometry : an Application to Discrete Geodesic Paths. Pattern Recognition Letters, 2004, 25 (5), pp.561-570. ⟨10.1016/j.patrec.2003.12.002⟩. ⟨hal-00185089⟩