๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

An isoperimetric inequality for convex polygons and convex sets with the same symmetrals

โœ Scribed by Marco Longinetti

Publisher
Springer
Year
1986
Tongue
English
Weight
512 KB
Volume
20
Category
Article
ISSN
0046-5755

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

An Optimal Algorithm for the Intersectio
An Optimal Algorithm for the Intersection Radius of a Set of Convex Polygons
โœ Shreesh Jadhav; Asish Mukhopadhyay; Binay Bhattacharya ๐Ÿ“‚ Article ๐Ÿ“… 1996 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 224 KB

The intersection radius of a finite collection of geometrical objects in the plane is the radius of the smallest closed disk that intersects all the objects in the collection. Bhattacharya et al. showed how the intersection radius can be found in linear time for a collection of line segments in the

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