A new characterization of digital lines by least square fits

DOI10.1016/0167-8655(93)90080-WMaRDI QIDQ4275201zbMATH OpenOpenAlexWikidataFDO

Authors Robert A. Melter, Ivan Stojmenović, Joviša Žunić

Publication date 26 January 1994

Published in Pattern Recognition Letters (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1016/0167-8655(93)90080-w

zbMATH Keywords

digital line segmentsleast square line fits

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) Computing methodologies for image processing (68U10)

Recommendations

• Representation of digital line segments and their preimages
• scientific article; zbMATH DE number 1873272
• Discrete Geometry for Computer Imagery
• Digitalizing line segments
• Consistent digital line segments

Cited in

(8)

• scientific article; zbMATH DE number 1873272 (Why is no real title available?)
• scientific article; zbMATH DE number 2079724 (Why is no real title available?)
• An Efficient Structural Technique for Encoding 'Best-fit' Straight Lines
• Consistent digital line segments
• Representation of digital line segments and their preimages
• On the number of digital straight line segments
• Least squares fitting of digital polynomial segments
• Measuring linearity of curves in \(2D\) and \(3D\)

This page was built for publication: A new characterization of digital lines by least square fits

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