volume 26, issue 3, P307-320 2001
DOI: 10.1007/s00454-001-0039-6
View full text
|
|
Share

## Abstract: Abstract. Let S be a set of n points in R 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(n 5 )-time algorithm for computing ω * , 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ω * containing S.

Search citation statements

Order By: Relevance

Paper Sections

0
0
0
0
0

Citation Types

0
18
0

Publication Types

Select...

Relationship

0
0

Authors

Journals