Distance transformations in digital images
Computer Vision, Graphics, and Image Processing
On the recognition of digital planes in three-dimensional space
Pattern Recognition Letters
Frequencies of Sturmian series factors
Theoretical Computer Science
Three distance theorem and grid graph
Discrete Mathematics
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
A Comparative Evaluation of Length Estimators of Digital Curves
IEEE Transactions on Pattern Analysis and Machine Intelligence
On digital plane preimage structure
Discrete Applied Mathematics - Special issue: IWCIA 2003 - Ninth international workshop on combinatorial image analysis
Digital segments and Hausdorff discretization
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Patterns in discretized parabolas and length estimation
DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Three-Dimensional Digital Planes
IEEE Transactions on Pattern Analysis and Machine Intelligence
Discrete Representation of Straight Lines
IEEE Transactions on Pattern Analysis and Machine Intelligence
| Hi-index | 5.23 |
We show that for some special functions (called k-multigrid equidistributed functions), we can compute the limit of the frequency of patterns in the discretization of their graph, when the resolution tends to zero. This result is applied to parabolas. We deduce also that local length estimators almost never converge to the length for the parabolas.