Let S be a set of n points in R3. Let ω* = ω*(S) 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 26(1+1/n4/9)ω* containing S.
|Number of pages||8|
|State||Published - 2000|
|Event||11th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA|
Duration: 9 Jan 2000 → 11 Jan 2000
|Conference||11th Annual ACM-SIAM Symposium on Discrete Algorithms|
|City||San Francisco, CA, USA|
|Period||9/01/00 → 11/01/00|