A new characterization of digital lines by least square fits

DOI10.1016/0167-8655(93)90080-WzbMATH Open0783.68138OpenAlexW1967635060WikidataQ57927425 ScholiaQ57927425MaRDI QIDQ4275201FDOQ4275201

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

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

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)

Cited In (8)

• An Efficient Structural Technique for Encoding 'Best-fit' Straight Lines
• Least squares fitting of digital polynomial segments
• On the number of digital straight line segments
• Title not available (Why is that?)
• Representation of digital line segments and their preimages
• Title not available (Why is that?)
• Measuring linearity of curves in \(2D\) and \(3D\)
• Consistent digital line segments

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)