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
Generalized geodesy via geodesic time
Pattern Recognition Letters
3D scan-conversion algorithms for voxel-based graphics
I3D '86 Proceedings of the 1986 workshop on Interactive 3D graphics
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]
Recognizing arithmetic straight lines and planes
DCGA '96 Proceedings of the 6th International Workshop on Discrete Geometry for Computer Imagery
Morphological Image Analysis: Principles and Applications
Morphological Image Analysis: Principles and Applications
Pattern Recognition Letters - Special issue: Discrete geometry for computer imagery (DGCI'2002)
Mutually visible agents in a discrete environment
ACSC '07 Proceedings of the thirtieth Australasian conference on Computer science - Volume 62
Weighted distances based on neighbourhood sequences
Pattern Recognition Letters
Discrete Applied Mathematics
Fast and accurate geodesic distance transform by ordered propagation
Image and Vision Computing
Weighted distances based on neighbourhood sequences in non-standard three-dimensional grids
SCIA'07 Proceedings of the 15th Scandinavian conference on Image analysis
Weighted neighbourhood sequences in non-standard three dimensional grids: metricity and algorithms
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Adaptive morphological filtering using similarities based on geodesic time
DGCI'08 Proceedings of the 14th IAPR international conference on Discrete geometry for computer imagery
Weighted neighborhood sequences in non-standard three-dimensional grids: parameter optimization
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Digital distance functions on three-dimensional grids
Theoretical Computer Science
Approximating Euclidean circles by neighbourhood sequences in a hexagonal grid
Theoretical Computer Science
Discrete average of two-dimensional shapes
CAIP'05 Proceedings of the 11th international conference on Computer Analysis of Images and Patterns
Two-Dimensional discrete morphing
IWCIA'04 Proceedings of the 10th international conference on Combinatorial Image Analysis
Distance transform computation for digital distance functions
Theoretical Computer Science
| Hi-index | 0.02 |
In this article, we present a discrete definition of the classical visibility in computational geometry based on digital straight fines. 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.