{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T11:58:17Z","timestamp":1725537497142},"publisher-location":"Berlin, Heidelberg","reference-count":27,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642041273"},{"type":"electronic","value":"9783642041280"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","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-04128-0_29","type":"book-chapter","created":{"date-parts":[[2009,9,14]],"date-time":"2009-09-14T14:16:36Z","timestamp":1252937796000},"page":"313-324","source":"Crossref","is-referenced-by-count":24,"title":["Shape Fitting on Point Sets with Probability Distributions"],"prefix":"10.1007","author":[{"given":"Maarten","family":"L\u00f6ffler","sequence":"first","affiliation":[]},{"given":"Jeff M.","family":"Phillips","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"volume-title":"Privacy Preserving Data Mining: Models and Algorithms","year":"2008","key":"29_CR1","unstructured":"Agarwal, C.C., Yu, P.S. (eds.): Privacy Preserving Data Mining: Models and Algorithms. Springer, Heidelberg (2008)"},{"key":"29_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Cheng, S.-W., Tao, Y., Yi, K.: Indexing uncertain data. In: PODS (2009)","DOI":"10.1007\/978-0-387-09690-2"},{"key":"29_CR3","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.: Geometric approximations via coresets. C. Trends Comb. and Comp. Geom. (E. Welzl) (2007)"},{"issue":"4","key":"29_CR4","doi-asserted-by":"publisher","first-page":"2004","DOI":"10.1145\/1008731.1008736","volume":"51","author":"P.K. Agarwal","year":"2004","unstructured":"Agarwal, P.K., Har-Peled, S., Varadarajan, K.R.: Approximating extent measure of points. J. ACM\u00a051(4) (2004)","journal-title":"J. ACM"},{"key":"29_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"54","DOI":"10.1007\/3-540-45749-6_9","volume-title":"Algorithms - ESA 2002","author":"P.K. Agarwal","year":"2002","unstructured":"Agarwal, P.K., Procopiuc, C.M., Varadarajan, K.R.: Approximation algorithms for k-line center. In: M\u00f6hring, R.H., Raman, R. (eds.) ESA 2002. LNCS, vol.\u00a02461, pp. 54\u201363. Springer, Heidelberg (2002)"},{"key":"29_CR6","unstructured":"Bandyopadhyay, D., Snoeyink, J.: Almost-Delaunay simplices: Nearest neighbor relations for imprecise points. In: SODA, pp. 403\u2013412 (2004)"},{"key":"29_CR7","unstructured":"B\u0103doiu, M., Clarkson, K.: Smaller core-sets for balls. In: SODA (2003)"},{"key":"29_CR8","doi-asserted-by":"publisher","first-page":"20","DOI":"10.1016\/j.comgeo.2005.10.002","volume":"35","author":"T. Chan","year":"2006","unstructured":"Chan, T.: Faster core-set constructions and data-stream algorithms in fixed dimensions. Computational Geometry: Theory and Applications\u00a035, 20\u201335 (2006)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"29_CR9","doi-asserted-by":"publisher","first-page":"579","DOI":"10.1006\/jagm.1996.0060","volume":"21","author":"B. Chazelle","year":"1996","unstructured":"Chazelle, B., Matousek, J.: On linear-time deterministic algorithms for optimization problems in fixed dimensions. J. Algorithms\u00a021, 579\u2013597 (1996)","journal-title":"J. Algorithms"},{"key":"29_CR10","doi-asserted-by":"crossref","unstructured":"Cormode, G., Garafalakis, M.: Histograms and wavelets of probabilitic data. In: ICDE (2009)","DOI":"10.1109\/ICDE.2009.74"},{"key":"29_CR11","doi-asserted-by":"crossref","unstructured":"Cormode, G., Li, F., Yi, K.: Semantics of ranking queries for probabilistic data and expected ranks. In: ICDE (2009)","DOI":"10.1109\/ICDE.2009.75"},{"key":"29_CR12","doi-asserted-by":"crossref","unstructured":"Eliazar, A., Parr, R.: Dp-slam 2.0. In: ICRA (2004)","DOI":"10.1109\/ROBOT.2004.1308006"},{"key":"29_CR13","series-title":"Lecture Notes in Computer Science","first-page":"325","volume-title":"Algorithms - ESA\u201999","author":"B. G\u00e4rtner","year":"1999","unstructured":"G\u00e4rtner, B.: Fast and robust smallest enclosing balls. In: Ne\u0161et\u0159il, J. (ed.) ESA 1999. LNCS, vol.\u00a01643, pp. 325\u2013338. Springer, Heidelberg (1999)"},{"key":"29_CR14","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Salesin, D., Stolfi, J.: Epsilon geometry: building robust algorithms from imprecise computations. In: SoCG, pp. 208\u2013217 (1989)","DOI":"10.1145\/73833.73857"},{"key":"29_CR15","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1007\/BF02187876","volume":"2","author":"D. Haussler","year":"1987","unstructured":"Haussler, D., Welzl, E.: epsilon-nets and simplex range queries. Disc. & Comp. Geom.\u00a02, 127\u2013151 (1987)","journal-title":"Disc. & Comp. Geom."},{"key":"29_CR16","doi-asserted-by":"publisher","first-page":"516","DOI":"10.1006\/jcss.2000.1741","volume":"62","author":"Y. Li","year":"2001","unstructured":"Li, Y., Long, P.M., Srinivasan, A.: Improved bounds on the samples complexity of learning. J. Comp. and Sys. Sci.\u00a062, 516\u2013527 (2001)","journal-title":"J. Comp. and Sys. Sci."},{"key":"29_CR17","volume-title":"Remote Sensing and Image Interpretaion","author":"T.M. Lillesand","year":"2004","unstructured":"Lillesand, T.M., Kiefer, R.W., Chipman, J.W.: Remote Sensing and Image Interpretaion. John Wiley & Sons, Chichester (2004)"},{"key":"29_CR18","doi-asserted-by":"crossref","unstructured":"L\u00f6ffler, M., Phillips, J.: Shape fitting on point sets with probability distributions. Technical Report UU-CS-2009-013, Utrecht University, Institute of Information and Computing Sciences (2009)","DOI":"10.1007\/978-3-642-04128-0_29"},{"key":"29_CR19","doi-asserted-by":"crossref","unstructured":"L\u00f6ffler, M., Snoeyink, J.: Delaunay triangulations of imprecise points in linear time after preprocessing. In: SoCG, pp. 298\u2013304 (2008)","DOI":"10.1145\/1377676.1377727"},{"key":"29_CR20","doi-asserted-by":"crossref","unstructured":"Matousek, J.: Approximations and optimal geometric divide-and-conquer. In: SToC, pp. 505\u2013511 (1991)","DOI":"10.1145\/103418.103470"},{"key":"29_CR21","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-03942-3","volume-title":"Geometric Discrepancy; An Illustrated Guide","author":"J. Matousek","year":"1999","unstructured":"Matousek, J.: Geometric Discrepancy; An Illustrated Guide. Springer, Heidelberg (1999)"},{"key":"29_CR22","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"252","DOI":"10.1007\/3-540-47738-1_24","volume-title":"Discrete and Computational Geometry","author":"T. Nagai","year":"2001","unstructured":"Nagai, T., Tokura, N.: Tight error bounds of geometric problems on convex objects with imprecise coordinates. In: Akiyama, J., Kano, M., Urabe, M. (eds.) JCDCG 2000. LNCS, vol.\u00a02098, pp. 252\u2013263. Springer, Heidelberg (2001)"},{"key":"29_CR23","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"447","DOI":"10.1007\/978-3-540-70575-8_37","volume-title":"Automata, Languages and Programming","author":"J.M. Phillips","year":"2008","unstructured":"Phillips, J.M.: Algorithms for \u03b5-Approximations of Terrains. In: Aceto, L., Damg\u00e5rd, I., Goldberg, L.A., Halld\u00f3rsson, M.M., Ing\u00f3lfsd\u00f3ttir, A., Walukiewicz, I. (eds.) ICALP 2008, Part I. LNCS, vol.\u00a05125, pp. 447\u2013458. Springer, Heidelberg (2008)"},{"key":"29_CR24","unstructured":"Shekhar, S., Chawla, S.: Spatial Databases: A Tour. Pearsons (2001)"},{"key":"29_CR25","unstructured":"van Kreveld, M., L\u00f6ffler, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. Comp. Geom. The. and App. (2009)"},{"key":"29_CR26","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V. Vapnik","year":"1971","unstructured":"Vapnik, V., Chervonenkis, A.: On the uniform convergence of relative frequencies of events to their probabilities. The. of Prob. App.\u00a016, 264\u2013280 (1971)","journal-title":"The. of Prob. App."},{"key":"29_CR27","doi-asserted-by":"crossref","unstructured":"Yu, H., Agarwal, P.K., Poreddy, R., Varadarajan, K.R.: Practical methods for shape fitting and kinetic data structures using coresets. In: SoCG (2004)","DOI":"10.1145\/997817.997858"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2009"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-04128-0_29","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T11:22:48Z","timestamp":1558524168000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-04128-0_29"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642041273","9783642041280"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-04128-0_29","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}