2013
DOI: 10.1007/978-3-642-38294-9_4
|View full text |Cite
|
Sign up to set email alerts
|

Discrete Set-Valued Continuity and Interpolation

Abstract: Abstract. 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… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
51
0
2

Year Published

2013
2013
2020
2020

Publication Types

Select...
6

Relationship

4
2

Authors

Journals

citations
Cited by 26 publications
(53 citation statements)
references
References 21 publications
0
51
0
2
Order By: Relevance
“…That is, strict cut components and their complementary sets can be handled both with the same unique connectivity, c 2n . As a consequence, the operators star and Sat commute on those sets, and we can prove [17] that:…”
Section: Interpolationmentioning
confidence: 83%
See 4 more Smart Citations
“…That is, strict cut components and their complementary sets can be handled both with the same unique connectivity, c 2n . As a consequence, the operators star and Sat commute on those sets, and we can prove [17] that:…”
Section: Interpolationmentioning
confidence: 83%
“…In particular, replacing the maximum operator by the median operator in Equation 1 leads to a pure self-dual definition of the tree of shapes of 2D images [17]. Furthermore the perspectives offered by that new representation might be far from being limited to the tree of shapes computation.…”
Section: Resultsmentioning
confidence: 99%
See 3 more Smart Citations