How a Digital Computer Can Tell Whether a Line is Straight

DOI10.2307/2320219MaRDI QIDQ3219790zbMATH OpenOpenAlexFDO

Authors 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

computational geometrydigital image processingdigitally convexdigitizationfinite sequence of lattice pointsregular rectangular latticestraight line

Mathematics Subject Classification ID

Discrete mathematics in relation to computer science (68R99)

Recommendations

• scientific article; zbMATH DE number 4041347
• scientific article; zbMATH DE number 4016245
• Digital straight lines in the Khalimsky plane
• What does digital straightness tell about digital convexity?
• On the number of digital straight line segments
• scientific article; zbMATH DE number 1438574

Cited in

(12)

• Parallel, overlapped, and intersected digital straight lines
• Computing convexity properties of images on a pyramid computer
• Cell complexes, oriented matroids and digital geometry.
• Digital straightness -- a review
• Covering a Euclidean line or hyperplane by dilations of its discretization
• On cellular straight line segments
• The number of digital straight lines on an N*N grid
• Digital images of geometric pictures
• scientific article; zbMATH DE number 1293246 (Why is no real title available?)
• Digital straightness
• Optimal covering of a straight line applied to discrete convexity
• Digital geometry

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3219790)