The number of digital straight lines on an N*N grid

DOI10.1109/18.50392zbMath0709.68077OpenAlexW2162865949MaRDI QIDQ3493299

J. Koplowitz, Michael Lindenbaum, Alfred Marcel Bruckstein

Publication date: 1990

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1109/18.50392

zbMATH Keywords

square griddigital straight lineslinear dichotomy of points

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10)

Related Items (17)

A characterization of 2-threshold functions via pairs of prime segments ⋮ Generalized Hausdorff dimensions of sets of real numbers with zero entropy expansion ⋮ Random generation of finite Sturmian words ⋮ Sturmian and Episturmian Words ⋮ A Shared Steganographic File System with Error Correction ⋮ On the number of linear partitions of the \((m,n)\)-grid ⋮ The Number of Khalimsky-Continuous Functions between Two Points ⋮ Digital Straightness, Circularity, and Their Applications to Image Analysis ⋮ Digital Straightness ⋮ Iterated Floor Function, Algebraic Numbers, Discrete Chaos, Beatty Subsequences, Semigroups ⋮ Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity ⋮ Reconstruction of tomographic images using analog projections and the digital Radon transform ⋮ Asymptotics of the number of 2-threshold functions ⋮ Digital straight segment filter for geometric description ⋮ Digital straightness -- a review ⋮ Sampling properties of the discrete Radon transform ⋮ Cutting Corners by Circles and Spheres

This page was built for publication: The number of digital straight lines on an N*N grid