How to make nD functions digitally well-composed in a self-dual way
DOI10.1007/978-3-319-18720-4_47zbMATH Open1445.68243OpenAlexW2257252002MaRDI QIDQ2946841FDOQ2946841
Authors: Nicolas Boutry, Thierry Géraud, Laurent Najman 
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
Recommendations
- On making \(n\)D images well-composed by a self-dual local interpolation
- Self-duality and digital topology: links between the morphological tree of shapes and well-composed gray-level images
- Topological properties of the first non-local digitally well-composed interpolation 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
interpolationdigital topologyself-dualitycubical gridequivalence of connectivitieswell-composed functions
Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Computing methodologies for image processing (68U10) Computational aspects of digital topology (68U03)
Cites Work
- Dimensional properties of graphs and digital spaces.
- Digital imaging: a unified topological framework
- Discrete set-valued continuity and interpolation
- 3D well-composed polyhedral complexes
- How to make \(n\)D 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 \(n\)D images well-composed by a self-dual local interpolation
- A quasi-linear algorithm to compute the tree of shapes of \(n\)D images
Cited In (16)
- Efficiently storing well-composed polyhedral complexes computed over 3D binary images
- Topological properties of the first non-local digitally well-composed interpolation 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 poset-based connected \(n\)-manifolds and \(\mathcal{P} \)-well-composedness in partially ordered sets
- One more step towards well-composedness of cell complexes over nD pictures
- Continuous well-composedness implies digital well-composedness in \(n\)-D
- Morphological hierarchical image decomposition based on Laplacian 0-crossings
- On making \(n\)D images well-composed by a self-dual local interpolation
- How to make \(n\)D 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 the Dahu pseudo-distance
- Well-composedness in Alexandrov spaces implies digital well-composedness in \(\mathbb {Z}^n\)
- Strong Euler well-composedness
- Equivalence between digital well-composedness and well-composedness in the sense of Alexandrov on \(n\)-d cubical grids
- Weakly well-composed cell complexes over nD pictures
This page was built for publication: How to make \(n\)D functions digitally well-composed in a self-dual way
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2946841)
