| DC Field | Value | Language |
|---|---|---|
| dc.contributor.author | Ivić, Aleksandar | en |
| dc.contributor.author | Koplowitz, Jack | en |
| dc.contributor.author | Žunić, Joviša | en |
| dc.date.accessioned | 2020-05-01T20:29:03Z | - |
| dc.date.available | 2020-05-01T20:29:03Z | - |
| dc.date.issued | 1994-12-01 | en |
| dc.identifier.isbn | 978-0-780-32015-8 | en |
| dc.identifier.issn | 2157-8095 | en |
| dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1976 | - |
| dc.description.abstract | Let D(m) denote the number of digital convex polygons which can be inscribed into an integer grid of size m × m. The asymptotic estimation of log D(m) is of interest in determining the entropy of digitized convex shapes. In this paper it is shown that log D(m) is of the order m2/3. | en |
| dc.publisher | IEEE | - |
| dc.relation.ispartof | IEEE International Symposium on Information Theory - Proceedings | en |
| dc.title | On the number of digital convex polygons | en |
| dc.type | Conference Paper | en |
| dc.relation.conference | IEEE International Symposium on Information Theory, ISIT 1994; Trondheim; Norway; 27 June 1994 through 1 July 1994 | - |
| dc.identifier.doi | 10.1109/ISIT.1994.394878 | en |
| dc.identifier.scopus | 2-s2.0-84894373744 | en |
| dc.relation.firstpage | 110 | en |
| item.cerifentitytype | Publications | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| item.openairetype | Conference Paper | - |
| item.grantfulltext | none | - |
| item.fulltext | No Fulltext | - |
| crisitem.author.orcid | 0000-0002-1271-4153 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.