Skip to Main content Skip to Navigation
Conference papers

Digital Plane Recognition with Fewer Probes

Abstract : We present a new plane-probing algorithm, i.e., an algorithm that computes the normal vector of a digital plane from a starting point and a predicate "Is a point x in the digital plane?". This predicate is used to probe the digital plane as locally as possible and decide on-the-fly the next points to consider. We show that this algorithm returns the same vector as another plane-probing algorithm proposed in Lachaud et al. (J. Math. Imaging Vis., 59, 1, 23-39, 2017), but requires fewer probes. The theoretical upper bound is indeed lowered from O(ω log ω) to O(ω) calls to the predicate, where ω is the arithmetical thickness of the digital plane, and far fewer calls are experimentally observed on average. This reduction is made possible by a study that shows how to avoid computations that do not contribute to the final solution. In the context of digital surface analysis, this new algorithm is expected to be of great interest for normal estimation and shape reconstruction.
Document type :
Conference papers
Complete list of metadata

Cited literature [14 references]  Display  Hide  Download
Contributor : Tristan Roussillon <>
Submitted on : Tuesday, April 2, 2019 - 10:41:56 AM
Last modification on : Monday, December 14, 2020 - 5:25:02 PM
Long-term archiving on: : Wednesday, July 3, 2019 - 1:46:22 PM


Files produced by the author(s)



Tristan Roussillon, Jacques-Olivier Lachaud. Digital Plane Recognition with Fewer Probes. 21st IAPR International Conference on Discrete Geometry for Computer Imagery, Couprie M.; Cousty J.; Kenmochi Y.; Mustafa N., Mar 2019, Marne-la-Vallée, France. pp.380-393, ⟨10.1007/978-3-030-14085-4_30⟩. ⟨hal-02087529⟩



Record views


Files downloads