2D and 3D Visibility in Discrete Geometry : an Application to Discrete Geodesic Paths - Archive ouverte HAL Access content directly
Journal Articles Pattern Recognition Letters Year : 2004

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

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.
Fichier principal
Vignette du fichier
Coeurjolly-2004_liris1222.pdf (754.42 Ko) Télécharger le fichier
Origin : Publisher files allowed on an open archive
Loading...

Dates and versions

hal-00185089 , version 1 (05-11-2007)

Identifiers

Cite

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⟩
211 View
183 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More