Bounds on the quality of the PCA bounding boxes

  • Authors:

  • Darko Dimitrov;Christian Knauer;Klaus Kriegel;Günter Rote

  • Affiliations:

  • Institut für Informatik, Freie Universität Berlin, Takustraße 9, D-14195 Berlin, Germany;Institut für Informatik, Freie Universität Berlin, Takustraße 9, D-14195 Berlin, Germany;Institut für Informatik, Freie Universität Berlin, Takustraße 9, D-14195 Berlin, Germany;Institut für Informatik, Freie Universität Berlin, Takustraße 9, D-14195 Berlin, Germany

  • Venue:
  • Computational Geometry: Theory and Applications
  • Year:
  • 2009

Quantified Score

Hi-index 0.00

Visualization

Abstract

Principal 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. We present examples of discrete points sets in the plane, showing that the worst case ratio of the volume of the PCA bounding box and the volume of the minimum-volume bounding box tends to infinity. Thus, we concentrate our attention on PCA bounding boxes for continuous sets, especially for the convex hull of a point set. Here, we contribute lower bounds on the approximation factor of PCA bounding boxes of convex sets in arbitrary dimension, and upper bounds in R^2 and R^3.