Papers
Topics
Authors
Recent
Search
2000 character limit reached

Determining the Number of Holes of a 2D Digital Component is Easy

Published 16 Nov 2012 in cs.CG, cs.DM, and math.CO | (1211.3812v1)

Abstract: The number of holes in a connected component in 2D images is a basic invariant. In this note, a simple formula was proven using our previous results in digital topology (Chen 2004, Chen and Rong (2010). The new is: $h =1+ (|C_4|-|C_2|)/4$, where h is the number of holes, and $C_i$ indicate the set of corner points having $i$ direct adjacent points in the component.

Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.