A Composite and Quasi Linear Time Method for Digital Plane Recognition

DOI10.1007/11907350_28MaRDI QIDQ5386034zbMATH OpenOpenAlexFDO

Authors Lilian Buzer

Publication date 17 April 2008

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

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

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Recommendations

• An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition
• A fast and elementary algorithm for digital plane recognition
• An elementary digital plane recognition algorithm
• A linear incremental algorithm for naive and standard digital lines and planes recognition
• Discrete Geometry for Computer Imagery

Cited in

(9)

• Digital hyperplane fitting
• An elementary digital plane recognition algorithm
• Thoughts on 3D digital subplane recognition and minimum-maximum of a bilinear congruence sequence
• A fast and elementary algorithm for digital plane recognition
• A linear incremental algorithm for naive and standard digital lines and planes recognition
• scientific article; zbMATH DE number 2087479 (Why is no real title available?)
• Discrete Geometry for Computer Imagery
• Digital Planar Surface Segmentation Using Local Geometric Patterns
• An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition

This page was built for publication: A Composite and Quasi Linear Time Method for Digital Plane Recognition

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