TOPICS
Search

Cylinder Covering


A cylinder covering of a set K subset R^3 is a finite family of generalized cylinders C_i=B_i+Ru_i whose union contains K. Each u_i is a unit vector, and its base B_i subset u_i^_|_ is a measurable set of finite area. All norms and areas use the Euclidean convention. The bases need not be disks. The cost is sum_(i)area(B_i), counting overlaps with multiplicity (Bezdek and Litvak 2009). For a convex body K, write pi_(u^_|_) for orthogonal projection and define

 A_(min)(K)=min_(||u||=1)area(pi_(u^_|_)K).

The half-area conjecture proposes that every such covering has cost at least A_(min)(K)/2. The stronger directionwise conjecture proposes

 sum_(i)(area(B_i))/(area(pi_(u_i^_|_)K))>=1/2.

The directionwise ratios are invariant under invertible affine transformations. They are different from a ratio using one minimum projection area for all directions.


See also

Convex Body, Cylinder, Orthogonal Projection, Tarski's Plank Problem

Explore with Wolfram|Alpha

References

Bezdek, K. and Khan, M. A. "The Geometry of Homothetic Covering and Illumination." In Discrete Geometry and Symmetry (Ed. M. D. E. Conder, A. Deza, and A. Ivić Weiss). Cham, Switzerland: Springer, pp. 1-30, 2018. https://doi.org/10.1007/978-3-319-78434-2_1.Bezdek, K. and Litvak, A. E. "Covering Convex Bodies by Cylinders and Lattice Points by Flats." J. Geom. Anal. 19, 233-243, 2009. https://doi.org/10.1007/s12220-008-9063-6.

Cite this as:

Weisstein, Eric W. "Cylinder Covering." From MathWorld--A Wolfram Resource. https://mathworld.wolfram.com/CylinderCovering.html

Subject classifications