An Optimized Framework for Plane-Probing Algorithms - Archive ouverte HAL Access content directly
Journal Articles Journal of Mathematical Imaging and Vision Year : 2020

An Optimized Framework for Plane-Probing Algorithms

Jacques-Olivier Lachaud
  • Function : Author
  • PersonId : 852577
Jocelyn Meyron
Tristan Roussillon


A plane-probing algorithm 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. However, several existing plane-probing algorithms return the correct normal vector only for some specific starting points and an approximation otherwise, e.g. the Hand R-algorithm proposed in Lachaud et al. (J. Math. Imaging Vis., 59, 1, 23-39, 2017). In this paper, we present a general framework for these plane-probing algorithms that provides a way of retrieving the correct normal vector from any starting point, while keeping their main features. There are O(ω log ω) calls to the predicate in the worst-case scenario, where ω is the thickness of the underlying digital plane, but far fewer calls are experimentally observed on average. In the context of digital surface analysis, the resulting algorithm is expected to be of great interest for normal estimation and shape reconstruction.
Fichier principal
Vignette du fichier
2020JMIV.pdf (2.52 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-02879784 , version 1 (24-06-2020)



Jacques-Olivier Lachaud, Jocelyn Meyron, Tristan Roussillon. An Optimized Framework for Plane-Probing Algorithms. Journal of Mathematical Imaging and Vision, 2020, 62, pp.718-736. ⟨10.1007/s10851-020-00965-6⟩. ⟨hal-02879784⟩
115 View
135 Download



Gmail Mastodon Facebook X LinkedIn More