Abstract
We prove that the genus of the boundary of a digital image is precisely half of the sum of the cycle ranks of three particular graphs: the "foreground graph" and "background graph," which capture topological information about the digital image and its complement, respectively, and the Reeb graph, relative to the natural height function, associated with the digital image's boundary. We prove several additional results, including a characterization of when the cycle rank of the Reeb graph fails to equal the genus of the digital image's boundary (which can happen by virtue of the failure of the natural height function on the boundary of the digital image to be a Morse function).
Article PDF
Similar content being viewed by others
Author information
Authors and Affiliations
Corresponding authors
Rights and permissions
About this article
Cite this article
Abrams, L., Fishkind, D. The Genus of a Digital Image Boundary Is Determined by Its Foreground, Background, and Reeb Graphs. Discrete Comput Geom 37, 629–640 (2007). https://doi.org/10.1007/s00454-007-1315-x
Issue Date:
DOI: https://doi.org/10.1007/s00454-007-1315-x