Exact and approximation algorithms for minimum-width cylindrical shells

Pankaj K. Agarwal, Boris Aronov, Micha Sharir

Research output: Contribution to conferencePaperpeer-review

Abstract

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.

Original languageEnglish
Pages510-517
Number of pages8
StatePublished - 2000
Externally publishedYes
Event11th Annual ACM-SIAM Symposium on Discrete Algorithms - San Francisco, CA, USA
Duration: 9 Jan 200011 Jan 2000

Conference

Conference11th Annual ACM-SIAM Symposium on Discrete Algorithms
CitySan Francisco, CA, USA
Period9/01/0011/01/00

Fingerprint

Dive into the research topics of 'Exact and approximation algorithms for minimum-width cylindrical shells'. Together they form a unique fingerprint.

Cite this