Complexity analysis for digital hyperplane recognition in arbitrary fixed dimension

DOI10.1007/978-3-540-31965-8_27MaRDI QIDQ5316536zbMATH OpenOpenAlexFDO

Authors Valentin E. Brimkov, Stephan Stoyanov Danchev

Publication date 13 September 2005

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/b135490

zbMATH Keywords

Digital hyperplanedigital plane recognitioninteger programming

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10)

Recommendations

• scientific article; zbMATH DE number 4211554
• A Composite and Quasi Linear Time Method for Digital Plane Recognition
• An elementary digital plane recognition algorithm
• An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition
• A fast and elementary algorithm for digital plane recognition

Cited in

(7)

• A generalized preimage for the digital analytical hyperplane recognition
• On the flatness of digital hyperplanes
• Digital hyperplane fitting
• Efficient robust digital hyperplane fitting with bounded error
• A question of digital linear algebra
• A Composite and Quasi Linear Time Method for Digital Plane Recognition
• An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition

This page was built for publication: Complexity analysis for digital hyperplane recognition in arbitrary fixed dimension

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