We present an approach to compute the number of holes in binary images using the Vertex Chain Code (VCC); the VCC was developed for representing and analyzing 2D shapes composed of cells. Using this code, it is possible to relate the outer to inner vertices of any 2D shape and to find interesting properties. Now, in this paper, we describe more properties of the VCC, such as the computation of the connected regions in a hole, the analysis of complementary chains, the computation of the number of holes in a binary shape or image, the computation of the Euler number, and the detection of convex and concave shapes. Finally, in order to illustrate the capabilities of proposed methods, we present the computation of topological properties of examples of objects of the real world.

中文翻译：

---

用顶点链码计算欧拉数的一种方法。

我们提出一种使用顶点链代码（VCC）计算二进制图像中孔数的方法。VCC是为表示和分析由单元格组成的2D形状而开发的。使用此代码，可以将任何2D形状的外部顶点与内部顶点相关联，并找到有趣的属性。现在，在本文中，我们将描述VCC的更多属性，例如孔中连接区域的计算，互补链的分析，二进制形状或图像中孔数的计算，VCC的计算。欧拉数，以及检测凹凸形状。最后，为了说明所提出方法的功能，我们介绍了现实世界中对象示例的拓扑属性的计算。