Abstract
Let S be a set of n points in \reals 3 . Let \opt be the width (i.e., thickness) of a minimum-width infinite cylindrical shell (the region between two co-axial cylinders) containing S . We first present an O(n 5 ) -time algorithm for computing \opt , which as far as we know is the first nontrivial algorithm for this problem. We then present an O(n 2+δ ) -time algorithm, for any δ>0 , that computes a cylindrical shell of width at most 56\opt containing S .
Article PDF
Similar content being viewed by others
Avoid common mistakes on your manuscript.
Author information
Authors and Affiliations
Additional information
Received May 31, 2000, and in revised form October 25, 2000. Online publication August 29, 2001.
Rights and permissions
About this article
Cite this article
Agarwal, P., Aronov, B. & Sharir, M. Exact and Approximation Algorithms for Minimum-Width Cylindrical Shells. Discrete Comput Geom 26, 307–320 (2001). https://doi.org/10.1007/s00454-001-0039-6
Published:
Issue Date:
DOI: https://doi.org/10.1007/s00454-001-0039-6