On the number of tubes touching a sphere or a tube
The paper considers three packing problems closely related to the kissing number problem and the Tammes problem. The first two problems are to determine the maximum number of flexible tubes of unit radius that can touch a ball of arbitrary radius in three-space from the outside, or from the inside. The third is to determine the maximum number of flexible tubes of unit radius that can touch another tube of arbitrary radius. For each problem an upper bound is derived. Applications are suggested in mechanical engineering (theory of wire ropes and multistrand cables) and biology (DNA condensation and protein folding).
- Colloquium: Geometrical approach to protein folding: a tube picture
- A Panoramic View of Riemannian Geometry
- Arrangement of 24 points on a sphere
- Global curvature, thickness, and the ideal shapes of knots
- scientific article; zbMATH DE number 1224949 (Why is no real title available?)
- scientific article; zbMATH DE number 1226894 (Why is no real title available?)
- scientific article; zbMATH DE number 1877241 (Why is no real title available?)
- On the minimum ropelength of knots and links
- On the number of cylinders touching a ball
- On the number of cylinders touching a ball
- The densest packing of equal circles on a sphere
- The Writhing Number of a Space Curve
- There is More than One Way to Frame a Curve
This page was built for publication: On the number of tubes touching a sphere or a tube
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2494088)