A discrete isoperimetric problem
DOI10.1023/A:1004997002327zbMATH Open0876.52001OpenAlexW1598926050MaRDI QIDQ674793FDOQ674793
Authors: 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
Recommendations
Applications of graph theory (05C90) Length, area, volume and convex sets (aspects of convex geometry) (52A38) Convex sets in (2) dimensions (including convex curves) (52A10) Inequalities and extremum problems involving convexity in convex geometry (52A40)
Cited In (18)
- Isodiametric problems for polygons
- Enumerating isodiametric and isoperimetric polygons
- Isoperimetric polygons of maximum width
- Sporadic Reinhardt polygons
- Small convex polytopes with long edges and many vertices
- Title not available (Why is that?)
- An isodiametric problem for equilateral polygons
- Extremal problems for spherical convex polygons
- Diameter graphs of polygons and the proof of a conjecture of Graham
- Tight bounds on the maximal perimeter of convex equilateral small polygons
- The small octagon with longest perimeter
- Isoperimetrically optimal polygons in the triangular grid
- A $1 Problem
- Isoperimetrically optimal polygons in the triangular grid with Jordan-type neighbourhood on the boundary
- Tight bounds on the maximal perimeter and the maximal width of convex small polygons
- On the perimeters of simple polygons contained in a disk
- Maximal perimeter, diameter and area of equilateral unit-width convex polygons
- Extremal problems for convex polygons
This page was built for publication: A discrete isoperimetric problem
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q674793)
