Name
Abstract | ||
|---|---|---|
A convex set is inscribed into a rectangle with sides a and 1/a so that the convex set has points on all four sides of the rectangle. By “rounding” we mean the composition of two orthogonal
linear transformations parallel to the edges of the rectangle, which makes a unit square out of the rectangle. The transformation
is also applied to the convex set, which now has the same area, and is inscribed into a square. One would expect this transformation
to decrease the perimeter of the convex set as well. Interestingly, this is not always the case. For each a we determine the largest and smallest possible increase of the perimeter. |
Year | DOI | Venue |
|---|---|---|
2007 | 10.1007/s-10998-007-1031-2 | Periodica Mathematica Hungarica |
Keywords | Field | DocType |
geometric inequality,planar convex set,perimeter,isoperimetric problem,51M16,51M25,26D07,53A05,52A10 | Orthogonal convex hull,Absolutely convex set,Topology,Combinatorics,Largest empty rectangle,Rectangle,Convex hull,Convex set,Subderivative,Convex polytope,Mathematics | Journal |
Volume | Issue | Citations |
54 | 1 | 0 |
PageRank | References | Authors |
0.34 | 0 | 1 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| László Csirmaz | 1 | 163 | 15.86 |