Delaunay property and proximity results of the L-algorithm - Archive ouverte HAL
Reports Year : 2022

Delaunay property and proximity results of the L-algorithm

Tristan Roussillon
Jui-Ting Lu
David Coeurjolly

Abstract

On digital planes (set of integer points between two parallel Euclidean planes), plane-probing algorithms initiate with a triangle, update one vertex at a time and approximate the plane on the fly. The L-algorithm is a plane-probing algorithm variant which takes into account a large neighborhood of points for its update process. We recall the framework of plane-probing algorithms, especially for the L-algorithm. We introduce the Delaunay property and prove that it is theoretically held by the L-algorithm. Lastly, we name a few consequences of such property, namely the research of minimal bases and an estimation for the locality. This technical report is provided as supplementary material to the DGMM2022 paper [11].
Fichier principal
Vignette du fichier
paper.pdf (1.48 Mo) Télécharger le fichier
Origin Files produced by the author(s)

Dates and versions

hal-03719592 , version 1 (11-07-2022)

Identifiers

  • HAL Id : hal-03719592 , version 1

Cite

Tristan Roussillon, Jui-Ting Lu, Jacques-Olivier Lachaud, David Coeurjolly. Delaunay property and proximity results of the L-algorithm. [Research Report] Université de Lyon. 2022. ⟨hal-03719592⟩
56 View
102 Download

Share

More