Computation of the Euler number using the contact perimeter

Authors:
Ernesto Bribiesca
Affiliations:
-
Venue:
Computers & Mathematics with Applications
Year:
2010

Citing 12
Cited 0

Computing the euler characteristic and related additive functionals of digital objects from their bintree representation

Computer Vision, Graphics, and Image Processing
A fast algorithm to calculate the Euler number for binary images

Pattern Recognition Letters
Glossary of computer vision terms

Pattern Recognition
Digital image processing algorithms

Digital image processing algorithms
Parallel computation of the Euler number via connectivity graph

Pattern Recognition Letters
A fully parallel 3D thinning algorithm and its applications

Computer Vision and Image Understanding
Digital Picture Processing

Digital Picture Processing
Computer Vision

Computer Vision
Digital Image Processing (3rd Edition)

Digital Image Processing (3rd Edition)
A pipeline architecture for computing the Euler number of a binary image

Journal of Systems Architecture: the EUROMICRO Journal
A note on 'A fully parallel 3D thinning algorithm and its applications'

Pattern Recognition Letters
An easy measure of compactness for 2D and 3D shapes

Pattern Recognition

Quantified Score

Hi-index	0.09

Visualization

Abstract

We present the computation of the Euler number of shapes using the contact perimeter. The contact perimeter was initially defined in [E. Bribiesca, Measuring 2D shape compactness using the contact perimeter, Comput. Math. Appl. 33 (1997) 1-9]. In this reference the contact perimeter was used to define a measure of compactness for 2D shapes. Now, in this paper we use the contact perimeter to compute the Euler number of unit-width objects composed of different side-connected cells and face-connected polyhedrons in two and three dimensions, respectively. Finally, we present some applications of this computation in knot and graph theory.