| 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 | 1993-12-01 | en |
| dc.identifier.issn | 0277-786X | en |
| dc.identifier.uri | http://researchrepository.mi.sanu.ac.rs/handle/123456789/1980 | - |
| dc.description.abstract | Let D(m) denote the number of digital convex polygons which can be inscribed into an integer grid of size m x in. 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 logD(m) is of the order m2/3 | en |
| dc.publisher | SPIE | - |
| dc.relation.ispartof | Proceedings of SPIE - The International Society for Optical Engineering | en |
| dc.title | Number of digital convex polygons inscribed into an (m,m)-grid | en |
| dc.type | Conference Paper | en |
| dc.relation.conference | Vision Geometry II 1993; Boston; United States; 7 September 1993 through 10 September 1993 | - |
| dc.identifier.doi | 10.1117/12.165003 | en |
| dc.identifier.scopus | 2-s2.0-85075931730 | en |
| dc.relation.firstpage | 78 | en |
| dc.relation.lastpage | 88 | en |
| dc.relation.volume | 2060 | en |
| item.openairetype | Conference Paper | - |
| item.openairecristype | http://purl.org/coar/resource_type/c_18cf | - |
| item.cerifentitytype | Publications | - |
| 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.