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.
Domains
Image Processing [eess.IV]
Origin : Publisher files allowed on an open archive
Loading...