Computational geometry: an introduction
Computational geometry: an introduction
Combinatorial optimization: algorithms and complexity
Combinatorial optimization: algorithms and complexity
On the maximal number of edges of convex digital polygons included into an m × m-grid
Journal of Combinatorial Theory Series A
Real data—integer solution problems with the Blum-Shub-Smale computational model
Journal of Complexity
Computers and Intractability: A Guide to the Theory of NP-Completeness
Computers and Intractability: A Guide to the Theory of NP-Completeness
On the polyhedral complexity of the integer points in a hyperball
Theoretical Computer Science
Digitization scheme that assures faithful reconstruction of plane figures
Pattern Recognition
Shape elongation from optimal encasing rectangles
Computers & Mathematics with Applications
Hi-index | 0.00 |
Given a set S ******2, denote $S_{\mathbb {Z}} = S \cap \mathbb {Z}^2$. We obtain bounds for the number of vertices of the convex hull of S *** , where S ******2 is a convex region bounded by two circular arcs. Two of the bounds are tight bounds--in terms of arc length and in terms of the width of the region and the radii of the circles, respectively. Moreover, an upper bound is given in terms of a new notion of "set oblongness." The results complement the well-known O (r 2/3) bound [2] which applies to a disc of radius r .