On a problem of Croft on optimally nested regular polygons

DOI10.1007/s00022-011-0065-3zbMath1231.68264OpenAlexW2088143985MaRDI QIDQ641703

Stephen Dilworth, S. R. Mane

Publication date: 25 October 2011

Published in: Journal of Geometry (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/s00022-011-0065-3

zbMATH Keywords

axes of symmetrypolygon containmentoptimally nested polygons

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05) Polyhedra and polytopes; regular figures, division of spaces (51M20) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Related Items (1)

Computing Maximal Copies of Polyhedra Contained in a Polyhedron

Cites Work

• Optimally nested regular n-gons
• An Ancient Elliptic Locus
• Folding Optimal Polygons from Squares

This page was built for publication: On a problem of Croft on optimally nested regular polygons