How a Digital Computer Can Tell Whether a Line is Straight

DOI10.2307/2320219zbMath0556.68037OpenAlexW4249261138MaRDI QIDQ3219790

Azriel Rosenfeld, Chul Eung Kim

Publication date: 1982

Published in: The American Mathematical Monthly (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.2307/2320219

zbMATH Keywords

digital image processingcomputational geometrydigitizationstraight linedigitally convexfinite sequence of lattice pointsregular rectangular lattice

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Related Items (6)

Covering a Euclidean line or hyperplane by dilations of its discretization ⋮ Cell complexes, oriented matroids and digital geometry. ⋮ Computing convexity properties of images on a pyramid computer ⋮ Digital Straightness ⋮ Digital geometry ⋮ Digital straightness -- a review

This page was built for publication: How a Digital Computer Can Tell Whether a Line is Straight