TY - JOUR
T1 - Exact and approximation algorithms for minimum-width cylindrical shells
AU - Agarwal, P. K.
AU - Aronov, B.
AU - Sharir, M.
PY - 2001/10
Y1 - 2001/10
N2 - Let S be a set of n points in ℝ3. Let ω* 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(n5)-time algorithm for computing ω*, which as far as we know is the first nontrivial algorithm for this problem. We then present an O(n2+δ)-time algorithm, for any δ > 0, that computes a cylindrical shell of width at most 56ω* containing S.
AB - Let S be a set of n points in ℝ3. Let ω* 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(n5)-time algorithm for computing ω*, which as far as we know is the first nontrivial algorithm for this problem. We then present an O(n2+δ)-time algorithm, for any δ > 0, that computes a cylindrical shell of width at most 56ω* containing S.
UR - http://www.scopus.com/inward/record.url?scp=0035618009&partnerID=8YFLogxK
U2 - 10.1007/s00454-001-0039-6
DO - 10.1007/s00454-001-0039-6
M3 - ???researchoutput.researchoutputtypes.contributiontojournal.article???
AN - SCOPUS:0035618009
SN - 0179-5376
VL - 26
SP - 307
EP - 320
JO - Discrete and Computational Geometry
JF - Discrete and Computational Geometry
IS - 3
ER -