1996
DOI: 10.1016/0012-365x(95)00195-3
|View full text |Cite
|
Sign up to set email alerts
|

An exact construction of digital convex polygons with minimal diameter

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1
1
1
1

Citation Types

0
4
0

Year Published

1998
1998
2023
2023

Publication Types

Select...
5
2
1

Relationship

0
8

Authors

Journals

citations
Cited by 10 publications
(4 citation statements)
references
References 3 publications
0
4
0
Order By: Relevance
“…This output of the polynomial is similar with the default output of the fitting polynomial obtained by Mathematica (10), where all the coefficients, except the constant term, have six significant digits. According to Table 4, one can conclude that P = 0.…”
Section: Application Of the Algorithm On The Fitting Polynomial (D < N)mentioning
confidence: 72%
See 1 more Smart Citation
“…This output of the polynomial is similar with the default output of the fitting polynomial obtained by Mathematica (10), where all the coefficients, except the constant term, have six significant digits. According to Table 4, one can conclude that P = 0.…”
Section: Application Of the Algorithm On The Fitting Polynomial (D < N)mentioning
confidence: 72%
“…Sometimes, we are faced with different mathematical problems which are partially or completely unsolvable without using a PC. For example, it helps us to generate large number (approximately 2000) of new 2-designs [1] or completely solve the problem of optimal construction of digital convex polygons with n vertices, n ∈ N [10,11]. Also, it is well known that the analysis of experimental data must be done by using the software support utilities.…”
Section: Introductionmentioning
confidence: 99%
“…It has been shown in [19] and [1] that such convex n-gons can be constructed so that they can be inscribed inside a square grid of side-size Θ(n 3/2 ). Therefore, by using such convex n-gon, our senders can be covered, according to the construction above, using ( √ k + O(n 3/2 )) 2 = k + O(n 3/2 √ k + n 3 ) n-gons, hence the schedule requires k + O(n 3/2 √ k + n 3 ) transmission rounds.…”
Section: A General Upper Boundmentioning
confidence: 99%
“…(An exact construction of optimal Qi(n) polygons for arbitrary n is given in [6].) [3] Optimal convex lattice polygons 231…”
Section: C\= Ffmentioning
confidence: 99%