On the Number of Digital Convex Polygons Inscribed into an (m, m)-Grid

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-01-01	en
dc.identifier.issn	0018-9448	en
dc.identifier.uri	http://researchrepository.mi.sanu.ac.rs/handle/123456789/1979	-
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 m. The asymptotic estimation of log D(m) is of interest in determining the entropy of.	en
dc.publisher	IEEE	-
dc.relation.ispartof	IEEE Transactions on Information Theory	en
dc.title	On the Number of Digital Convex Polygons Inscribed into an (m, m)-Grid	en
dc.type	Article	en
dc.identifier.doi	10.1109/18.333894	en
dc.identifier.scopus	2-s2.0-0028514928	en
dc.relation.firstpage	1681	en
dc.relation.lastpage	1686	en
dc.relation.issue	5	en
dc.relation.volume	40	en
item.cerifentitytype	Publications	-
item.openairecristype	http://purl.org/coar/resource_type/c_18cf	-
item.openairetype	Article	-
item.grantfulltext	none	-
item.fulltext	No Fulltext	-
crisitem.author.orcid	0000-0002-1271-4153	-

16

checked on Nov 19, 2024

14

checked on Nov 19, 2024

Check