Computation of the Euler number using the contact perimeter
From MaRDI portal
Publication:611468
DOI10.1016/j.camwa.2010.06.018zbMath1201.05025MaRDI 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
68T10: Pattern recognition, speech recognition
05C10: Planar graphs; geometric and topological aspects of graph theory
05C85: Graph algorithms (graph-theoretic aspects)
Cites Work
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- 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