On a problem of Croft on optimally nested regular polygons

DOI10.1007/S00022-011-0065-3zbMATH Open1231.68264OpenAlexW2088143985MaRDI QIDQ641703FDOQ641703

Authors: S. J. 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

Recommendations

• Inscribing a regular \(m\)-gon in a regular \(n\)-gon
• Zur Gitterpunktüberdeckung durch reguläre n-Ecke mit ungerader Eckenzahl. (On lattice-point-coverings by regular n-gons with an odd number of vertices)
• An extremum problem for the power moment of a convex polygon contained in a disc
• scientific article; zbMATH DE number 6938032
• The problem of best cut of regular polygons

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)

Cites Work

• Optimally nested regular n-gons
• An ancient elliptic locus
• Folding Optimal Polygons from Squares

Cited In (6)

• An edge-minimization problem for regular polygons
• Inscribing a regular \(m\)-gon in a regular \(n\)-gon
• Title not available (Why is that?)
• The geometry of nesting problems: a tutorial
• Zur Gitterpunktüberdeckung durch reguläre n-Ecke mit ungerader Eckenzahl. (On lattice-point-coverings by regular n-gons with an odd number of vertices)
• Computing maximal copies of polyhedra contained in a polyhedron

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q641703)