DC FieldValueLanguage
dc.contributor.authorHuxley, Martinen
dc.contributor.authorŽunić, Jovišaen
dc.date.accessioned2020-05-01T20:28:59Z-
dc.date.available2020-05-01T20:28:59Z-
dc.date.issued2006en
dc.identifier.issn0162-8828en
dc.identifier.urihttp://researchrepository.mi.sanu.ac.rs/handle/123456789/1930-
dc.description.abstractA digital disc is the set of all integer points inside some given disc. Let DN be the number of different digital discs consisting of N points (different up to translation). The upper bound D N = O(N2) was shown recently; no corresponding lower bound is known. In this paper, we refine the upper bound to DN = O(N), which seems to be the true order of magnitude, and we show that the average DN = D1 + D2 + ... + DN)/N has upper and lower bounds which are of polynomial growth in N.en
dc.publisherIEEE-
dc.relation.ispartofIEEE Transactions on Pattern Analysis and Machine Intelligenceen
dc.subjectDigital disc | Digital geometry | Digitization | Enumerationen
dc.titleThe number of N-point digital discsen
dc.typeArticleen
dc.identifier.doi10.1109/TPAMI.2007.250606en
dc.identifier.pmid17108390en
dc.identifier.scopus2-s2.0-33947258283en
dc.contributor.affiliationMathematical Institute of the Serbian Academy of Sciences and Arts-
dc.relation.firstpage159en
dc.relation.lastpage161en
dc.relation.issue1en
dc.relation.volume29en
dc.description.rankM21a-
item.fulltextNo Fulltext-
item.openairetypeArticle-
item.grantfulltextnone-
item.cerifentitytypePublications-
item.openairecristypehttp://purl.org/coar/resource_type/c_18cf-
crisitem.author.orcid0000-0002-1271-4153-
Show simple item record

SCOPUSTM   
Citations

13
checked on Apr 1, 2025

Page view(s)

31
checked on Jan 31, 2025

Google ScholarTM

Check

Altmetric

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.