Abstract : 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.
https://hal.archives-ouvertes.fr/hal-00185089
Contributor : David Coeurjolly
<>
Submitted on : Monday, November 5, 2007 - 12:57:15 PM
Last modification on : Tuesday, February 26, 2019 - 3:44:45 PM
Long-term archiving on : Monday, April 12, 2010 - 1:18:16 AM
David Coeurjolly, S. Miguet, Laure Tougne. 2D and 3D Visibility in Discrete Geometry : an Application to Discrete Geodesic Paths. Pattern Recognition Letters, Elsevier, 2004, 25 (5), pp.561-570. ⟨10.1016/j.patrec.2003.12.002⟩. ⟨hal-00185089⟩
