Skip to main content
Conference ProceedingsOPEN ACCESS

Combinatorial relations for digital pictures

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2006) 4245 LNCS 189-198
DOI: 10.1007/11907350_16
7Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

In this paper we define the notion of gap in an arbitrary digital picture S in a digital space of arbitrary dimension. As a main result, we obtain an explicit formula for the number of gaps in S of maximal dimension. We also derive a combinatorial relation for a digital curve. © Springer-Verlag Berlin Heidelberg 2006.

Author supplied keywords

Cite

CITATION STYLE

APA

Brimkov, V. E., Moroni, D., & Barneva, R. (2006). Combinatorial relations for digital pictures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4245 LNCS, pp. 189–198). Springer Verlag. https://doi.org/10.1007/11907350_16

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free