How to Make nD Functions Digitally Well-Composed in a Self-dual Way

DOI10.1007/978-3-319-18720-4_47zbMath1445.68243OpenAlexW2257252002MaRDI QIDQ2946841

Laurent Najman, Thierry Géraud, Nicolas Boutry

Publication date: 18 September 2015

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

Full work available at URL: https://doi.org/10.1007/978-3-319-18720-4_47

zbMATH Keywords

interpolationself-dualitydigital topologycubical gridequivalence of connectivitieswell-composed functions

Mathematics Subject Classification ID

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

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, 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, One More Step Towards Well-Composedness of Cell Complexes over nD Pictures, How to make \(n\)-D plain maps defined on discrete surfaces Alexandrov-well-composed in a self-dual way, Strong Euler well-composedness, Introducing the Dahu Pseudo-Distance, Morphological Hierarchical Image Decomposition Based on Laplacian 0-Crossings

Cites Work

• Dimensional properties of graphs and digital spaces.
• Digital imaging: a unified topological framework
• 3D well-composed polyhedral complexes
• 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
• On Making nD Images Well-Composed by a Self-dual Local Interpolation
• Discrete Set-Valued Continuity and Interpolation
• A Quasi-linear Algorithm to Compute the Tree of Shapes of nD Images