Given a set P of n points in three dimensions, a cylindrical shell (or zone cylinder) is formed by two circular cylinders with the same axis such that all points of P are between the two cylinders. We prove that the number of cylindrical shells enclosing P passing through combinatorially different subsets of P has size Ω(n 3) and O(n 4) (the previously known bound was O(n 5)). As a consequence, the minimum enclosing shell can be found in O(n 4) time.
ISO/DIS 12180. \newblock Geometrical product specifications (gps) – cylindricity, 2000.
Pankaj K. Agarwal Boris Aronov Micha Sharir (2001) ArticleTitleExact and approximation algorithms for minimum-width cylindrical shells. Discrete Comput. Geom. 26 307–320 Occurrence Handle2002i:52009 Occurrence Handle0988.68203
Bernard Chazelle (1993) ArticleTitleAn optimal convex hull algorithm in any fixed dimension. Discrete Comput. Geom. 10 377–409 Occurrence Handle94h:52026 Occurrence Handle0786.68091
Olivier Devillers Bernard Mourrain Franco P. Preparata Philippe Trebuchet (2003) ArticleTitleOn circular cylinders by four or five points in space. Discrete Comput. Geom. 29 83–104 Occurrence Handle10.1007/s00454-002-2811-7 Occurrence Handle01883356
Olivier Devillers and Franco P. Preparata. Evaluating the cylindricity of a nominally cylindrical point set. In Proc. 11th ACM–SIAM Sympos. Discrete Algorithms, pages 518–527, 2000.
Sariel Har-Peled and Kasturi R. Varadarajan.Approximate shape fitting via linearization. In Proc. 42nd Annu. IEEE Sympos. Found. Comput. Sci., 2001.
About this article
Cite this article
Devillers, O. The Number of Cylindrical Shells. Discrete Comput Geom 30, 453–458 (2003). https://doi.org/10.1007/s00454-003-2818-8
- Cylindrical Shell
- Circular Cylinder