Upper and Lower Bounds on the Quality of the PCA Bounding Boxes

Dimitrov,D., Knauer,Ch., Kriegel,K., Rote,G.

Abstract:
Principle component analysis (PCA) is commonly used to compute a bounding box of a point set in R^d. The popularity of this heuristic lies in its speed, easy implementation and in the fact that usually, PCA bounding boxes quite well approximate the minimum-volume bounding boxes. In this paper we give a lower bound on the approximation factor of PCA bounding boxes of convex polytopes in arbitrary dimension, and an upper bound on the approximation factor of PCA bounding boxes of convex polygons in R^2.