Discrete Set-Valued Continuity and Interpolation

DOI10.1007/978-3-642-38294-9_4zbMath1382.68269OpenAlexW200963588MaRDI QIDQ4925093

Thierry Géraud, Laurent Najman

Publication date: 11 June 2013

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-642-38294-9_4

zbMATH Keywords

tree of shapes

Mathematics Subject Classification ID

Computing methodologies for image processing (68U10) Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items

Continuous well-composedness implies digital well-composedness in \(n\)-D, Efficiently storing well-composed polyhedral complexes computed over 3D binary images, How to Make nD Functions Digitally Well-Composed in a Self-dual Way, Self-duality and Digital Topology: Links Between the Morphological Tree of Shapes and Well-Composed Gray-Level Images, Introducing poset-based connected \(n\)-manifolds and \(\mathcal{P} \)-well-composedness in partially ordered sets, Weakly well-composed cell complexes over nD pictures, Topological properties of the first non-local digitally well-composed interpolation on \(n\)-D cubical grids, Equivalence between digital well-composedness and well-composedness in the sense of Alexandrov on \(n\)-d cubical grids, A tutorial on well-composedness, How to make \(n\)-D plain maps defined on discrete surfaces Alexandrov-well-composed in a self-dual way, Introducing the Dahu Pseudo-Distance

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Geometric description of images as topographic maps
• Dimension on discrete spaces
• Digitally continuous multivalued functions, morphological operations and thinning algorithms
• Well-Composed Cell Complexes
• ‘Continuous’ functions on digital pictures
• Digitally continuous functions
• A Quasi-linear Algorithm to Compute the Tree of Shapes of nD Images
• Combinatorial Image Analysis
• Set-valued analysis