A discrete isoperimetric problem

DOI10.1023/A:1004997002327zbMath0876.52001OpenAlexW1598926050MaRDI QIDQ674793

Basudeb Datta

Publication date: 27 October 1997

Published in: Geometriae Dedicata (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1023/a:1004997002327

zbMATH Keywords

extremal n-gonsmaximum perimeter

Mathematics Subject Classification ID

Applications of graph theory (05C90) Inequalities and extremum problems involving convexity in convex geometry (52A40) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Convex sets in (2) dimensions (including convex curves) (52A10)

Related Items (12)

Extremal problems for spherical convex polygons ⋮ The small octagon with longest perimeter ⋮ Maximal perimeter, diameter and area of equilateral unit-width convex polygons ⋮ Tight bounds on the maximal perimeter of convex equilateral small polygons ⋮ Sporadic Reinhardt polygons ⋮ Small convex polytopes with long edges and many vertices ⋮ Extremal problems for convex polygons ⋮ Isoperimetrically Optimal Polygons in the Triangular Grid ⋮ Enumerating isodiametric and isoperimetric polygons ⋮ Isoperimetric polygons of maximum width ⋮ Tight bounds on the maximal perimeter and the maximal width of convex small polygons ⋮ Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary

This page was built for publication: A discrete isoperimetric problem