Visibility in Discrete Geometry: an application to discrete geodesic paths

David Coeurjolly (1)

1 ERIC - Entrepôts, Représentation et Ingénierie des Connaissances

In this article, we present a discrete definition of the classical visibility in computational geometry. We present 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. Visibility in Discrete Geometry: an application to discrete geodesic paths. Discrete Geometry for Computer Imagery, 10th International Conference, 2002, Bordeaux, France. pp.316--327. ⟨hal-00185214⟩