 |
Journal articles
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.
Cited literature [31 references]
https://hal.archives-ouvertes.fr/hal-00185089
Contributor : David Coeurjolly <>
Submitted on : Monday, November 5, 2007 - 12:57:15 PM
Last modification on : Wednesday, July 8, 2020 - 12:42:08 PM
Long-term archiving on: : Monday, April 12, 2010 - 1:18:16 AM
Contributor : David Coeurjolly <>
Submitted on : Monday, November 5, 2007 - 12:57:15 PM
Last modification on : Wednesday, July 8, 2020 - 12:42:08 PM
Long-term archiving on: : Monday, April 12, 2010 - 1:18:16 AM
File
Coeurjolly-2004_liris1222.pdf
Publisher files allowed on an open archive