Computing the minimum enclosing sphere of free-form hypersurfaces in arbitrary dimensions

The problem of computing the minimum enclosing sphere (MES) of a point set is a classical problem in Computational Geometry. As an LP-type problem, its expected running time on the average is linear in the number of points. In this paper, we generalize this approach to compute the minimum enclosing sphere of free-form hypersurfaces, in arbitrary dimensions. This paper makes the bridge between discrete point sets (for which indeed the results are well-known) and continuous curves and surfaces, showing that the general solution for the former can be adapted for the latter. To compute the MES of a pair of hypersurfaces, each one having a contact point (a point at which the sphere touches the hypersurface), antipodal constraints are employed. For more than a pair, equidistance constraints along with tangency constraints are applied. These constraints yield a finite set of solution points which is used to identify the minimum enclosing sphere. The algorithm uses the LP-characteristic of t...

• Type: Journal
• Year: 2011
• Where: CAD
• Authors: Ramanathan Muthuganapathy, Gershon Elber, Gill Barequet, Myung-Soo Kim
• Keywords: CAD 2011, Classical Problem, Equidistance Constraints, Minimum Enclosing Sphere, Theoretical Computer Science