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

DOI10.1007/978-3-540-79126-3_31zbMath1138.68586OpenAlexW1760000096MaRDI QIDQ5458902

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

Related Items

An output-sensitive algorithm to compute the normal vector of a digital plane ⋮ Gift-wrapping based preimage computation algorithm ⋮ Two plane-probing algorithms for the computation of the normal vector to a digital plane ⋮ A new lattice-based plane-probing algorithm ⋮ An optimized framework for plane-probing algorithms ⋮ Maximal Planes and Multiscale Tangential Cover of 3D Digital Objects ⋮ Recognition of Digital Hyperplanes and Level Layers with Forbidden Points ⋮ Fitting discrete polynomial curve and surface to noisy data ⋮ An alternative definition for digital convexity ⋮ Digital Plane Recognition with Fewer Probes

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