Digital segments and Hausdorff discretization

Authors:
Mohamed Tajine
Affiliations:
LSIIT, CNRS, UMR, Université Louis Pasteur (Strasbourg 1), Illkirch-Graffenstaden, France
Venue:
IWCIA'08 Proceedings of the 12th international conference on Combinatorial image analysis
Year:
2008

Citing 7
Cited 3

On the Number of Digital Straight Line Segments

IEEE Transactions on Pattern Analysis and Machine Intelligence
Fractals everywhere

Fractals everywhere
On the number of factors of Sturmian words

Theoretical Computer Science
Frequencies of Sturmian series factors

Theoretical Computer Science
Discretization in Hausdorff Space

Journal of Mathematical Imaging and Vision
Topological properties of Hausdorff discretization, and comparison to other discretization schemes

Theoretical Computer Science
Digital planarity-A review

Discrete Applied Mathematics

Technical Section: About the frequencies of some patterns in digital planes. Application to area estimators

Computers and Graphics
Patterns in discretized parabolas and length estimation

DGCI'09 Proceedings of the 15th IAPR international conference on Discrete geometry for computer imagery
Patterns for multigrid equidistributed functions: Application to general parabolas and length estimation

Theoretical Computer Science

Quantified Score

Hi-index	0.00

Visualization

Abstract

In this paper we investigate some properties of digital segments in floor and Hausdorff discretizations. We characterize the Hausdorff discretization of straight lines and we prove that the frequency of digital segment in a digital straight line is continuous and piecewise affine function relatively to the slope. It allows to prove some combinatorial properties of digital segments. In particular we give a new proof of the results in [3,2,8] corresponding to the frequencies and the numbers of digital segments of size m.