Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Martin N. Huxley

dblp:79/6393 · DBLP profile ↗
← Back
2ranked-venue papers
2as first author
0since 2021 · last 2007
0009-0007-4715-0814ORCID · verified

Domains — the database's venue-derived domains; a paper can count in several

Artificial intelligence and machine learning · 1 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 1 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Theoretical computer science
1 paper
Computational geometry · 100%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational geometry › digital geometry
digital disk
0.112007
The Number of N-Point Digital Discs · IEEE Trans. Pattern Anal. Mach. Intell. 2007
Computational geometry
digital geometry
0.112007
The Number of N-Point Digital Discs · IEEE Trans. Pattern Anal. Mach. Intell. 2007
Computational geometry
discrete geometry
0.112007
The Number of N-Point Digital Discs · IEEE Trans. Pattern Anal. Mach. Intell. 2007

Methods — techniques the papers use, named apart from their topics

asymptotic analysis · 0.1
YearPublicationVenuePosition
2007 The Number of N-Point Digital Discs
abstract
A digital disc is the set of all integer points inside some given disc. Let {\cal D}_{N} be the number of different digital discs consisting of N points (different up to translation). The upper bound D(N) = O(N(2)) was shown recently; no corresponding lower bound is known. In this paper, we refine the upper bound to D(N) = O(N), which seems to be the true order of magnitude, and we show that the average [formula: see text] has upper and lower bounds which are of polynomial growth in N.
Martin N. Huxley, Jovisa D. Zunic
IEEE Trans. Pattern Anal. Mach. Intell.1
2004 On the Number of Digitizations of a Disc Depending on Its Position
Martin N. Huxley, Jovisa D. Zunic
IWCIA1