𝔖 Bobbio Scriptorium
✦   LIBER   ✦

Two Inequalities for Convex Sets with Lattice Point Constraints in the Plane

✍ Scribed by Scott, P. R.

Book ID
120093091
Publisher
Oxford University Press
Year
1979
Tongue
English
Weight
96 KB
Volume
11
Category
Article
ISSN
0024-6093

No coin nor oath required. For personal study only.

πŸ“œ SIMILAR VOLUMES

New fixed-point theorems for two maps an
New fixed-point theorems for two maps and applications to problems on sets with convex sections and minimax inequalities
✍ K.Q. Lan πŸ“‚ Article πŸ“… 2004 πŸ› Elsevier Science 🌐 English βš– 774 KB

New fixed-point theorems for two maps defined on product spaces are obtained. These new results only require one of them to satisfy a noncompactness condition. Previous results required each map to satisfy a noncompactness condition. Applications of our results are given to intersection problems for

An optimal real time algorithm for deter
An optimal real time algorithm for determine the convex hull of a set of points in a plane
✍ Z.Q. Wang; L.J. Xiao πŸ“‚ Article πŸ“… 1998 πŸ› Elsevier Science 🌐 English βš– 282 KB

Based on the properties of star polygon and that the convex polygon is a special kind of star polygon, with the star point as the origin and the two lines respectively parallel to the x-axis and y-axis as coordinate axis, a relative coordinate system is built and the planar area is divided into four