On fencing problems

DOI10.1016/j.jmaa.2004.06.050zbMath1080.52002OpenAlexW2050616734MaRDI QIDQ703674

Carla Peri, Salvador Segura Gomis, Cinzia Miori

Publication date: 11 January 2005

Published in: Journal of Mathematical Analysis and Applications (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.jmaa.2004.06.050

zbMATH Keywords

Optimizationplanar convex bodiesbisectionsFencing problemshyperplane cutsrelative diameterstraight line cuts

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Convex sets in (n) dimensions (including convex hypersurfaces) (52A20)

Related Items (7)

Subdivisions of rotationally symmetric planar convex bodies minimizing the maximum relative diameter ⋮ Optimal divisions of a convex body ⋮ Trisections of a 3-rotationally symmetric planar convex body minimizing the maximum relative diameter ⋮ The fencing problem and coleochaete cell division ⋮ Bisections of centrally symmetric planar convex bodies minimizing the maximum relative diameter ⋮ On the isodiametric and isominwidth inequalities for planar bisections ⋮ Borsuk number for planar convex bodies

Cites Work

• Unsolved problems in geometry
• Relative isodiametric inequalities
• The Maximal Length of Chords Bisecting the Area Or Perimeter Length of Plane Convex Sets
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: On fencing problems