We prove that the perimeter of any convex n-gons of diameter 1 is at most 2n sin(pi/2n). Equality is attained here if and only if n has an odd factor. In the latter case, there are (up to congruence) only finitely many extremal n-gons. In fact, the convex n-gons of diameter I and perimeter 2n sin(pi/2n) are in bijective correspondence with the solutions of a diophantine problem
AbstractAn elementary proof is given for the number of convex polyominos of perimeter 2m+4
Gradients of the perimeter and area of a polygon have straightforward geometric interpretations. The...
Given a number P, we study the following three isoperimetric problems introduced by Besicovitch in 1...
We prove that the perimeter of any convex n-gons of diameter 1 is at most 2n sin(pi/2n). Equality is...
AbstractFor a positive integer n that is not a power of 2, precisely the same family of convex polyg...
AbstractFor a positive integer n that is not a power of 2, precisely the same family of convex polyg...
Abstract What is the minimum perimeter of a convex lattice n-gon? This question was answered by Jarn...
The discrete isoperimetric problem is to determine the maximal area polygon with at most k vertices ...
The maximal perimeter of an equilateral convex polygon with unit diameter and n = 2 m edges is not k...
Abstract. We give an elementary proof of the isoperimetric inequality for poly-gons, simplifying the...
The topic that I choose to study for this thesis was the isoperimetric problem which seeks to determ...
The celebrated isoperimetric theorem says that the circle provides the least-perimeter way to enclos...
The isoperimetric problem is an exercise of classical geometry posing the following question. If a c...
One of the most widely-known classical geometry problems is the so-called isoperimetric problem, one...
In this thesis we prove a one parameter family of Bonnesen-style and Osserman-style discrete Sobolev...
AbstractAn elementary proof is given for the number of convex polyominos of perimeter 2m+4
Gradients of the perimeter and area of a polygon have straightforward geometric interpretations. The...
Given a number P, we study the following three isoperimetric problems introduced by Besicovitch in 1...
We prove that the perimeter of any convex n-gons of diameter 1 is at most 2n sin(pi/2n). Equality is...
AbstractFor a positive integer n that is not a power of 2, precisely the same family of convex polyg...
AbstractFor a positive integer n that is not a power of 2, precisely the same family of convex polyg...
Abstract What is the minimum perimeter of a convex lattice n-gon? This question was answered by Jarn...
The discrete isoperimetric problem is to determine the maximal area polygon with at most k vertices ...
The maximal perimeter of an equilateral convex polygon with unit diameter and n = 2 m edges is not k...
Abstract. We give an elementary proof of the isoperimetric inequality for poly-gons, simplifying the...
The topic that I choose to study for this thesis was the isoperimetric problem which seeks to determ...
The celebrated isoperimetric theorem says that the circle provides the least-perimeter way to enclos...
The isoperimetric problem is an exercise of classical geometry posing the following question. If a c...
One of the most widely-known classical geometry problems is the so-called isoperimetric problem, one...
In this thesis we prove a one parameter family of Bonnesen-style and Osserman-style discrete Sobolev...
AbstractAn elementary proof is given for the number of convex polyominos of perimeter 2m+4
Gradients of the perimeter and area of a polygon have straightforward geometric interpretations. The...
Given a number P, we study the following three isoperimetric problems introduced by Besicovitch in 1...