Efficient robust digital hyperplane fitting with bounded error

DOI10.1007/978-3-642-19867-0_19zbMATH Open1272.68420OpenAlexW1486190374MaRDI QIDQ3000702FDOQ3000702

Authors: Dror Aiger, Yukiko Kenmochi, Hugues Talbot, Lilian Buzer 

Publication date: 19 May 2011

Published in: Discrete Geometry for Computer Imagery (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-19867-0_19

Recommendations

• Digital hyperplane fitting
• Efficient robust digital annulus fitting with bounded error
• The exact fitting problem in higher dimensions
• Discrete Geometry for Computer Imagery
• An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition

zbMATH Keywords

linear programmingrandomizationfittingapproximationdigital hyperplane

Mathematics Subject Classification ID

Linear programming (90C05) Computing methodologies for image processing (68U10)

Cited In (4)

• Efficient robust digital annulus fitting with bounded error
• Locating hyperplanes to fitting set of points: a general framework
• Digital hyperplane fitting
• Fitting discrete polynomial curve and surface to noisy data

This page was built for publication: Efficient robust digital hyperplane fitting with bounded error

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