Minimum spanning ellipsoids

Authors:
Mark J. Post
Affiliations:
-
Venue:
STOC '84 Proceedings of the sixteenth annual ACM symposium on Theory of computing
Year:
1984

Citing 4
Cited 7

Fundamentals of interactive computer graphics

Fundamentals of interactive computer graphics
An Algorithm for Convex Polytopes

Journal of the ACM (JACM)
Computational geometry.

Computational geometry.
Ellipsoids and computational geometry

Ellipsoids and computational geometry

A subexponential bound for linear programming

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
A class of convex programs with applications to computational geometry

SCG '92 Proceedings of the eighth annual symposium on Computational geometry
Efficient algorithms for geometric optimization

ACM Computing Surveys (CSUR)
On linear-time deterministic algorithms for optimization problems in fixed dimension

SODA '93 Proceedings of the fourth annual ACM-SIAM Symposium on Discrete algorithms
Obstacle Collision Detection Using Best Ellipsoid Fit

Journal of Intelligent and Robotic Systems
An efficient method for the retrieval of objects by topological relations in spatial database systems

Information Processing and Management: an International Journal
Incremental procedures for partitioning highly intermixed multi-class datasets into hyper-spherical and hyper-ellipsoidal clusters

Data & Knowledge Engineering

Quantified Score

Hi-index	0.00

Visualization

Abstract

The notion of a minimum spanning ellipsoid in any dimension is explained. Basic definitions and theorems provide the ideas for an algorithm to find the minimum spanning ellipsoid of a set of points, i.e., the ellipsoid of minimum volume containing the set. The run-time of the algorithm O (n2) independent of dimension, where n is the number of points.