On the number of digital straight line segments

DOI10.1109/34.9109zbMath0674.68054OpenAlexW2143245098MaRDI QIDQ3829085

David Lavine, Carlos. A. Berenstein

Publication date: 1988

Published in: IEEE Transactions on Pattern Analysis and Machine Intelligence (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/1903/4602

zbMATH Keywords

pattern recognitiondigital geometrygeometric probabilitydigitization errorchain-code stringnumber of line segments

Mathematics Subject Classification ID

Pattern recognition, speech recognition (68T10) Computation of special functions and constants, construction of tables (65D20)

Related Items (17)

Cutting corners with spheres in \(d\)-dimensions ⋮ On the maximal number of edges of convex digital polygons included into an \(m \times m\)-grid ⋮ A complete characterization of the \((m, n)\)-cubes and combinatorial applications in imaging, vision and discrete geometry ⋮ Unnamed Item ⋮ The number of Khalimsky-continuous functions on intervals ⋮ A minimal subsystem of the Kari–Culik tilings ⋮ Sturmian and Episturmian Words ⋮ The Number of Khalimsky-Continuous Functions between Two Points ⋮ Topology-preserving conditions for 2D digital images under rigid transformations ⋮ Fast recognition of a digital straight line subsegment: two algorithms of logarithmic time complexity ⋮ The number of continuous curves in digital geometry ⋮ Enumeration formula for \((2,n)\)-cubes in discrete planes ⋮ About the Frequencies of Some Patterns in Digital Planes Application to Area Estimators ⋮ Asymptotics of the number of 2-threshold functions ⋮ Digital straight segment filter for geometric description ⋮ Digital straightness -- a review ⋮ Cutting Corners by Circles and Spheres

This page was built for publication: On the number of digital straight line segments