Covering n-segment unit arcs is not sufficient

DOI10.1007/S00454-006-1258-7MaRDI QIDQ878063zbMATH OpenOpenAlexFDO

Authors Chatchawan Panraksa, John E. Wetzel, Wacharin Wichiramala

Publication date 26 April 2007

Published in Discrete \& Computational Geometry (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/s00454-006-1258-7

Mathematics Subject Classification ID

Convex sets in (2) dimensions (including convex curves) (52A10)

Review text

In this note the authors construct a compact convex set which contains, for each positive integer \(n\), a congruent copy of any \(n\)-segment polygonal arc of unit length, but not every unit arc. It disproves a conjecture posed by \textit{J. Gerriets} and \textit{G. Poole} in [Am. Math. Mon. 81, 36--41 (1974; Zbl 0279.52007)].

Recommendations

• Small convex covers for convex unit arcs
• A small cover for convex unit arcs
• A smaller cover for convex unit arcs
• A covering theorem for families of sets in R^d
• Drapeable unit arcs fit in the unit \(30^\circ\) sector

Cited in

(4)

• Decomposition of convex figures into similar pieces
• Wetzel's sector covers unit arcs
• Partly Convex Peano Curves
• The broadest three-segment unit arc

This page was built for publication: Covering \(n\)-segment unit arcs is not sufficient

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