Smallest Enclosing Cylinders

This paper addresses the complexity of computing the smallest-radius infinite cylinder that encloses an input set of n points in 3-space. We show that the problem can be solved in time O(n4 logO(1) n) in an algebraic complexity model. We also achieve a time of O(n4 L

• Type: Conference
• Year: 1996
• Where: COMPGEOM
• Authors: Elmar Schömer, Jürgen Sellen, Marek Teichmann, Chee-Keng Yap
• Keywords: Algebraic Complexity Model, Bit Complexity Model, COMPGEOM 1996, Complexity Model, Discrete Geometry