The opaque square and the opaque circle (Q4357539)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 1066351
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | The opaque square and the opaque circle |
scientific article; zbMATH DE number 1066351 |
Statements
11 February 1999
0 references
opaque square
0 references
minimum Steiner trees
0 references
optimal curves
0 references
0.8300002813339233
0 references
0.8213379383087158
0 references
The opaque square and the opaque circle (English)
0 references
For a given set \(S\) in the Euclidean plane, a set of curves \(C\) is called opaque, if any line intersecting \(S\) intersects \(C\). Unknown to the author, \textit{Honsberger} [Am. Math. Mon. 405 (1966)] first suggested the problem of finding \(C\) of minimal length for a unit square, giving credit to Poirier for finding a solution of length \(2.64\dots\), beating the obvious Steiner tree solution of length \(2.73\dots\); Poirier's solution has been conjectured to be optimal. Also, \textit{V. Akman} [Inf. Process. Lett. 24, 193-198 (1987; Zbl 0653.68030)] and \textit{P. Dublish} [Inf. Process. Lett. 29, No. 5, 275-276 (1988; Zbl 0662.68040)] gave algorithms to compute a minimal opaque forest of a convex polygon. This author describes a partial proof of optimality for Poirier's solution. One important case is left open. He also shows that there is a family of inscribed opaque solutions for regular convex \(n\)-gons with length converging to \(\pi+2\), which is the known minimal opaque length for a unit circle. For the entire collection see [Zbl 0864.00057].
0 references