Protecting regular polygons

MaRDI QIDQ1580070zbMATH OpenFDO

Authors N. Delaunay, Arnfried Kemnitz, László Szabó, Zoltán Ujváry-Menyhárt

Publication date 13 September 2000

Published in Beiträge zur Algebra und Geometrie (Search for Journal in Brave)

Full work available at URL https://eudml.org/doc/121417, http://www.emis.de/journals/BAG/vol.41/no.2/8.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

protecting numberregular polygon

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10) Packing and covering in (2) dimensions (aspects of discrete geometry) (52C15)

Review text

The protecting number of a convex body \(K\) is defined. This is the minimum number of non-overlapping congruent copies of \(K\) so that they can touch \(K\) and any other congruent copy of \(K\) can not touch \(K\) without overlapping each other. The authors prove the following theorems. Theorem 1. The protecting number of any regular polygon is not greater than four. Theorem 2. The protecting number of the square is four. Theorem 3. The protecting number of the regular \(6n\)-gon is three for all positive integers \(n\).

Recommendations

• Protecting convex sets
• scientific article; zbMATH DE number 1086043
• The kissing number of the regular polygon
• Art gallery theorems for guarded guards.
• Convex hulls of edge-to-edge regular \(n\)-gons

Cited in

(2)

• Protecting convex sets
• Polygon guarding with orientation

This page was built for publication: Protecting regular polygons

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