Discrete set-valued continuity and interpolation - Archive ouverte HAL Access content directly
Conference Papers Year : 2013

Discrete set-valued continuity and interpolation


The main question of this paper is to retrieve some continuity properties on (discrete) T0-Alexandroff spaces. One possible application, which will guide us, is the construction of the so-called ''tree of shapes'' (intuitively, the tree of level lines). This tree, which should allow to process maxima and minima in the same way, faces quite a number of theoretical difficulties that we propose to solve using set-valued analysis in a purely discrete setting. We also propose a way to interpret any function defined on a grid as a ''continuous'' function thanks to an interpolation scheme. The continuity properties are essential to obtain a quasi-linear algorithm for computing the tree of shapes in any dimension, which is exposed in a companion paper.
Fichier principal
Vignette du fichier
discreteContinuityISMM2013.pdf (664.04 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-00798574 , version 1 (09-03-2013)


  • HAL Id : hal-00798574 , version 1


Laurent Najman, Thierry Géraud. Discrete set-valued continuity and interpolation. International Symposium on Mathematical Morphology, May 2013, Uppsala, Sweden. pp.37-48. ⟨hal-00798574⟩
256 View
524 Download


Gmail Facebook X LinkedIn More