An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition

DOI10.1007/978-3-540-79126-3_31zbMATH Open1138.68586OpenAlexW1760000096MaRDI QIDQ5458902FDOQ5458902

Authors Émilie Charrier, Lilian Buzer 

Publication date 24 April 2008

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

Full work available at URL https://doi.org/10.1007/978-3-540-79126-3_31

zbMATH Keywords

convex optimizationfeasibility problemquasi linear time complexityChord's algorithmDigital naive plane recognition

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Machine vision and scene understanding (68T45)

Recommendations

• A Composite and Quasi Linear Time Method for Digital Plane Recognition
• An elementary digital plane recognition algorithm
• A fast and elementary algorithm for digital plane recognition
• Discrete Geometry for Computer Imagery
• A linear incremental algorithm for naive and standard digital lines and planes recognition

Cited In (18)

• A fast and elementary algorithm for digital plane recognition
• A Composite and Quasi Linear Time Method for Digital Plane Recognition
• An output-sensitive algorithm to compute the normal vector of a digital plane
• Efficient robust digital hyperplane fitting with bounded error
• Recognition of digital hyperplanes and level layers with forbidden points
• Gift-wrapping based preimage computation algorithm
• \(O(n ^{3} \log n)\) time complexity for the optimal consensus set computation for 4-connected digital circles
• Thoughts on 3D digital subplane recognition and minimum-maximum of a bilinear congruence sequence
• Maximal planes and multiscale tangential cover of 3D digital objects
• Title not available (Why is no real title available?)
• An elementary digital plane recognition algorithm
• Two plane-probing algorithms for the computation of the normal vector to a digital plane
• A new lattice-based plane-probing algorithm
• Fitting discrete polynomial curve and surface to noisy data
• Discrete Geometry for Computer Imagery
• Digital plane recognition with fewer probes
• An optimized framework for plane-probing algorithms
• An alternative definition for digital convexity

This page was built for publication: An Efficient and Quasi Linear Worst-Case Time Algorithm for Digital Plane Recognition

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