Title: Upper and Lower Bounds on the Quality of the PCA Bounding Boxes
Authors: Dimitrov, Danko
Knauer, Christian
Kriegel, Klaus
Rote, Günter
Citation: WSCG '2007: Full Papers Proceedings: The 15th International Conference in Central Europe on Computer Graphics, Visualization and Computer Vision 2007 in co-operation with EUROGRAPHICS: University of West Bohemia Plzen Czech Republic, January 29 – February 1, 2007, p. 185-192.
Issue Date: 2007
Publisher: Václav Skala - UNION Agency
Document type: konferenční příspěvek
URI: http://wscg.zcu.cz/wscg2007/Papers_2007/full/!WSCG2007_Full_Proceedings_Final-1.zip
ISBN: 978-80-86943-98-5
Keywords: analýza hlavních komponent;výpočetní geometrie;ohraničení viditelné oblasti
Keywords in different language: principle component analysis;computational geometry;bounding box
Abstract: Principle component analysis (PCA) is commonly used to compute a bounding box of a point set in Rd. 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 R2.
Rights: © Václav Skala - UNION Agency
Appears in Collections:WSCG '2007: Full Papers Proceedings

Files in This Item:
File Description SizeFormat 
Dimitrov.pdfPlný text314,54 kBAdobe PDFView/Open
Dimitrov_prezentace.pdfPrezentace503,65 kBAdobe PDFView/Open

Please use this identifier to cite or link to this item: http://hdl.handle.net/11025/11009

Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.