How to make \(n\)-D plain maps defined on discrete surfaces Alexandrov-well-composed in a self-dual way

DOI10.1007/s10851-019-00873-4zbMath1446.68176OpenAlexW2914753005WikidataQ128413711 ScholiaQ128413711MaRDI QIDQ2320444

Thierry Géraud, Nicolas Boutry, Laurent Najman

Publication date: 23 August 2019

Published in: Journal of Mathematical Imaging and Vision (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s10851-019-00873-4

zbMATH Keywords

mathematical morphologyAlexandrov spacesdigital topologydiscrete surfacesfrontier orderswell-composednesstree of shapescross-section topology

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 (2)

Introducing poset-based connected \(n\)-manifolds and \(\mathcal{P} \)-well-composedness in partially ordered sets ⋮ Equivalence between digital well-composedness and well-composedness in the sense of Alexandrov on \(n\)-d cubical grids

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Dimensional properties of graphs and digital spaces.
• Geometric description of images as topographic maps
• A Jordan surface theorem for three-dimensional digital spaces
• Well-composedness in Alexandrov spaces implies digital well-composedness in \(\mathbb {Z}^n\)
• A tutorial on well-composedness
• Topological persistence and simplification
• Grain filters
• Mathematical morphology and its applications to image processing
• Repairing 3D binary images using the BCC grid with a 4-valued combinatorial coordinate system
• Weakly well-composed cell complexes over nD pictures
• 3D well-composed polyhedral complexes
• Efficiently storing well-composed polyhedral complexes computed over 3D binary images
• A Color Tree of Shapes with Illustrations on Filtering, Simplification, and Segmentation
• How to Make nD Functions Digitally Well-Composed in a Self-dual Way
• Well-Composed Cell Complexes
• The Jordan-Brouwer Separation Theorem for Smooth Hypersurfaces
• Discrete Set-Valued Continuity and Interpolation
• A Quasi-linear Algorithm to Compute the Tree of Shapes of nD Images
• Encoding Specific 3D Polyhedral Complexes Using 3D Binary Images
• Set-valued analysis
• Derived neighborhoods and frontier orders

This page was built for publication: How to make \(n\)-D plain maps defined on discrete surfaces Alexandrov-well-composed in a self-dual way