Distance transformations in digital images
Computer Vision, Graphics, and Image Processing
Computing distance transformations in convex and non-convex domains
Pattern Recognition
An Efficient Uniform Cost Algorithm Applied to Distance Transforms
IEEE Transactions on Pattern Analysis and Machine Intelligence
Local distances for distance transformations in two and three dimensions
Pattern Recognition Letters
Linear Programming in Linear Time When the Dimension Is Fixed
Journal of the ACM (JACM)
On Recursive, O(N) Partitioning of a Digitized Curve into Digital Straight Segments
IEEE Transactions on Pattern Analysis and Machine Intelligence
Segmentation and Length Estimation of 3D Discrete Curves
Digital and Image Geometry, Advanced Lectures [based on a winter school held at Dagstuhl Castle, Germany in December 2000]
Detecting Centres of Maximal Geodesic Discs on the Distance Transform of Surfaces in 3D Images
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Recognition of Digital Naive Planes and Polyhedrization
DGCI '00 Proceedings of the 9th International Conference on Discrete Geometry for Computer Imagery
Recognizing arithmetic straight lines and planes
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Geometric feature estimators for noisy discrete surfaces
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
| Hi-index | 0.00 |
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.