An edge-minimization problem for regular polygons

MaRDI QIDQ2380245zbMATH OpenFDO

Authors Ralph H. Buchholz, Warwick de Launey

Publication date 26 March 2010

Published in The Electronic Journal of Combinatorics (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/227705, http://www.emis.de/journals/EJC/Volume_16/Abstracts/v16i1r90.html

IPFS File on IPFS (Hint: this is only the Hash - if you get a timeout, this file is not available on our server.)

zbMATH Keywords

asymptotically optimal configurationsregular polygons

Mathematics Subject Classification ID

Combinatorial aspects of tessellation and tiling problems (05B45) Tilings in (2) dimensions (aspects of discrete geometry) (52C20)

Review text

The authors examine the following problem: What is the minimum number of unit edges required to construct \(k\) congruent regular polygons in the plane if sharing of edges is allowed? The problem was solved for the square, the equilateral triangle, and the regular hexagon by \textit{F.~Harary} and \textit{H.~Harborth} in [``Extremal animals, J. Comb. Inf. Syst. Sci. 1, 1--8 (1976; Zbl 0402.05055)]. In the paper under review asymptotically optimal configurations of regular \(n\)-gons for all \(n\) are obtained.

Recommendations

• Convex hulls of edge-to-edge regular \(n\)-gons
• scientific article; zbMATH DE number 440765
• The kissing number of the regular polygon
• scientific article; zbMATH DE number 3922677
• On a problem of Croft on optimally nested regular polygons

Cited in

(3)

• Convex hulls of edge-to-edge regular \(n\)-gons
• Patches with short boundaries
• Extremal \(\{ p, q\}\)-animals

This page was built for publication: An edge-minimization problem for regular polygons

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