Computation of the Euler number using the contact perimeter
From MaRDI portal
Publication:611468
DOI10.1016/j.camwa.2010.06.018zbMath1201.05025OpenAlexW2046337314MaRDI QIDQ611468
Publication date: 14 December 2010
Published in: Computers \& Mathematics with Applications (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.camwa.2010.06.018
Pattern recognition, speech recognition (68T10) Planar graphs; geometric and topological aspects of graph theory (05C10) Graph algorithms (graph-theoretic aspects) (05C85)
Related Items
Cites Work
- Measuring 2-D shape compactness using the contact perimeter
- Generating cubical complexes from image data and computation of the Euler number
- An easy measure of compactness for 2D and 3D shapes
- A fast algorithm to calculate the Euler number for binary images
- Computing the Euler characteristic and related additive functionals of digital objects from their bintree representation
- Parallel computation of the Euler number via Connectivity Graph
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item