Communication Dans Un Congrès Année : 2022

Approximation of Digital Surfaces by a Hierarchical Set of Planar Patches

Jocelyn Meyron

Résumé

We 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.

Fichier principal
Vignette du fichier
meyron-roussillon-camera-ready.pdf (1.72 Mo) Télécharger le fichier
Origine Fichiers produits par l'(les) auteur(s)
Licence

Dates et versions

hal-03769038 , version 1 (27-09-2022)

Licence

Identifiants

Citer

Jocelyn Meyron, Tristan Roussillon. Approximation of Digital Surfaces by a Hierarchical Set of Planar Patches. Discrete Geometry and Mathematical Morphology, Oct 2022, Strasbourg, France. pp.409-421, ⟨10.1007/978-3-031-19897-7_32⟩. ⟨hal-03769038⟩
126 Consultations
328 Téléchargements

Altmetric

Partager

  • More