{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T22:10:14Z","timestamp":1739398214102,"version":"3.37.0"},"publisher-location":"Berlin, Heidelberg","reference-count":15,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642102257"},{"type":"electronic","value":"9783642102264"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-10226-4_3","type":"book-chapter","created":{"date-parts":[[2009,10,21]],"date-time":"2009-10-21T15:35:58Z","timestamp":1256139358000},"page":"26-40","source":"Crossref","is-referenced-by-count":1,"title":["Closed-Form Solutions for Continuous PCA and Bounding Box Algorithms"],"prefix":"10.1007","author":[{"given":"Darko","family":"Dimitrov","sequence":"first","affiliation":[]},{"given":"Mathias","family":"Holst","sequence":"additional","affiliation":[]},{"given":"Christian","family":"Knauer","sequence":"additional","affiliation":[]},{"given":"Klaus","family":"Kriegel","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"3_CR1","doi-asserted-by":"publisher","first-page":"387","DOI":"10.1111\/1467-8659.1530387","volume":"15","author":"G. Barequet","year":"1996","unstructured":"Barequet, G., Chazelle, B., Guibas, L.J., Mitchell, J.S.B., Tal, A.: Boxtree: A hierarchical representation for surfaces in 3D. Computer Graphics Forum\u00a015, 387\u2013396 (1996)","journal-title":"Computer Graphics Forum"},{"issue":"1","key":"3_CR2","doi-asserted-by":"publisher","first-page":"91","DOI":"10.1006\/jagm.2000.1127","volume":"38","author":"G. Barequet","year":"2001","unstructured":"Barequet, G., Har-Peled, S.: Efficiently approximating the minimum-volume bounding box of a point set in three dimensions. J. Algorithms\u00a038(1), 91\u2013109 (2001)","journal-title":"J. Algorithms"},{"key":"3_CR3","doi-asserted-by":"crossref","unstructured":"Beckmann, N., Kriegel, H.-P., Schneider, R., Seeger, B.: The R *-tree: An efficient and robust access method for points and rectangles. In: ACM SIGMOD Int. Conf. on Manag. of Data, pp. 322\u2013331 (1990)","DOI":"10.1145\/93605.98741"},{"issue":"8","key":"3_CR4","doi-asserted-by":"publisher","first-page":"772","DOI":"10.1016\/j.comgeo.2008.02.007","volume":"42","author":"D. Dimitrov","year":"2009","unstructured":"Dimitrov, D., Knauer, C., Kriegel, K., Rote, G.: Bounds on the quality of the PCA bounding boxes. Computational Geometry\u00a042(8), 772\u2013789 (2009)","journal-title":"Computational Geometry"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Gottschalk, S., Lin, M.C., Manocha, D.: OBBTree: A hierarchical structure for rapid interference detection. In: SIGGRAPH 1996, pp. 171\u2013180 (1996)","DOI":"10.1145\/237170.237244"},{"key":"3_CR6","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: Source code of program for computing and approximating the diameter of a point-set in 3d (2000), http:\/\/www.uiuc.edu\/~sariel\/papers\/00\/diameter\/diam_prog.html","DOI":"10.1145\/378583.378662"},{"key":"3_CR7","doi-asserted-by":"crossref","unstructured":"Har-Peled, S.: A practical approach for computing the diameter of a point-set. In: Proc. 17th Annu. ACM Sympos. on Comput. Geom., pp. 177\u2013186 (2001)","DOI":"10.1145\/378583.378662"},{"key":"3_CR8","volume-title":"Principal Component Analysis","author":"I. Jolliffe","year":"2002","unstructured":"Jolliffe, I.: Principal Component Analysis, 2nd edn. Springer, New York (2002)","edition":"2"},{"key":"3_CR9","doi-asserted-by":"publisher","first-page":"2333","DOI":"10.1118\/1.1312808","volume":"27","author":"M. Lahanas","year":"2000","unstructured":"Lahanas, M., Kemmerer, T., Milickovic, N.: Optimized bounding boxes for three-dimensional treatment planning in brachytherapy. Med. Phys.\u00a027, 2333\u20132342 (2000)","journal-title":"Med. Phys."},{"key":"3_CR10","doi-asserted-by":"crossref","first-page":"54","DOI":"10.4153\/CJM-1951-008-7","volume":"3","author":"A.M. Macbeath","year":"1951","unstructured":"Macbeath, A.M.: A compactness theorem for affine equivalence classes of convex regions. Canadian J. Math.\u00a03, 54\u201361 (1951)","journal-title":"Canadian J. Math."},{"key":"3_CR11","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1007\/BF00991005","volume":"14","author":"J. O\u2019Rourke","year":"1985","unstructured":"O\u2019Rourke, J.: Finding minimal enclosing boxes. Int. J. Comp. Info. Sci. 14, 183\u2013199 (1985)","journal-title":"Int. J. Comp. Info. Sci."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Roussopoulos, N., Leifker, D.: Direct spatial search on pictorial databases using packed R-trees. In: ACM SIGMOD, pp. 17\u201331 (1985)","DOI":"10.1145\/971699.318900"},{"key":"3_CR13","unstructured":"Sellis, T., Roussopoulos, N., Faloutsos, C.: The R \u2009+\u2009-tree: A dynamic index for multidimensional objects. In: 13th VLDB Conference, pp. 507\u2013518 (1987)"},{"key":"3_CR14","unstructured":"Toussaint, G.: Solving geometric problems with the rotating calipers. In: IEEE MELECON, pp. A10.02\/1\u20134 (1983)"},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"Vrani\u0107, D.V., Saupe, D., Richter, J.: Tools for 3D-object retrieval: Karhunen-Loeve transform and spherical harmonics. In: IEEE 2001 Workshop Multimedia Signal Processing, pp. 293\u2013298 (2001)","DOI":"10.1109\/MMSP.2001.962749"}],"container-title":["Communications in Computer and Information Science","Computer Vision and Computer Graphics. Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-10226-4_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,12]],"date-time":"2025-02-12T21:37:37Z","timestamp":1739396257000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-10226-4_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642102257","9783642102264"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-10226-4_3","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2009]]}}}