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

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

É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)

Cited In (10)

• An output-sensitive algorithm to compute the normal vector of a digital plane
• Gift-wrapping based preimage computation algorithm
• Recognition of Digital Hyperplanes and Level Layers with Forbidden Points
• Digital Plane Recognition with Fewer Probes
• Maximal Planes and Multiscale Tangential Cover of 3D Digital Objects
• 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
• An optimized framework for plane-probing algorithms
• An alternative definition for digital convexity

   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 👍 👎

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)