Approximation of Digital Surfaces by a Hierarchical Set of Planar Patches

International audienceWe show that the plane-probing algorithms introduced in Lachaud et al. (J. Math. Imaging Vis., 59, 1, 23-39, 2017), which compute the normal vector of a digital plane from a starting point and a set-membership predicate, are closely related to a three-dimensional generalization of the Euclidean algorithm. In addition, we show how to associate with the steps of these algorithms generalized substitutions, i.e., rules that replace square faces by unions of square faces, to build finite sets of elements that periodically generate digital planes. This work is a first step towards the incremental computation of a hierarchy of pieces of digital plane that locally fit a digital surface