{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:23:33Z","timestamp":1760441013250},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642222993"},{"type":"electronic","value":"9783642223006"}],"license":[{"start":{"date-parts":[[2011,1,1]],"date-time":"2011-01-01T00:00:00Z","timestamp":1293840000000},"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":[[2011]]},"DOI":"10.1007\/978-3-642-22300-6_45","type":"book-chapter","created":{"date-parts":[[2011,8,9]],"date-time":"2011-08-09T12:41:31Z","timestamp":1312893691000},"page":"536-547","source":"Crossref","is-referenced-by-count":17,"title":["Geometric Computations on Indecisive Points"],"prefix":"10.1007","author":[{"given":"Allan","family":"J\u00f8rgensen","sequence":"first","affiliation":[]},{"given":"Maarten","family":"L\u00f6ffler","sequence":"additional","affiliation":[]},{"given":"Jeff M.","family":"Phillips","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"45_CR1","unstructured":"Agrawal, P., Benjelloun, O., Sarma, A.D., Hayworth, C., Nabar, S., Sugihara, T., Widom, J.: Trio: A system for data, uncertainty, and lineage. In: PODS (2006)"},{"key":"45_CR2","unstructured":"Bandyopadhyay, D., Snoeyink, J.: Almost-Delaunay simplices: Nearest neighbor relations for imprecise points. In: SODA (2004)"},{"key":"45_CR3","unstructured":"Bi, J., Zhang, T.: Support vector classification with input data uncertainty. In: NIPS (2004)"},{"key":"45_CR4","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. Journal of Algorithms\u00a021, 579\u2013597 (1996)","journal-title":"Journal of Algorithms"},{"key":"45_CR5","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":"45_CR6","doi-asserted-by":"crossref","unstructured":"Cormode, G., McGregor, A.: Approximation algorithms for clustering uncertain data. In: PODS (2008)","DOI":"10.1145\/1376916.1376944"},{"key":"45_CR7","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/s00778-006-0004-3","volume":"16","author":"N. Dalvi","year":"2007","unstructured":"Dalvi, N., Suciu, D.: Efficient query evaluation on probabilitic databases. The VLDB Journal\u00a016, 523\u2013544 (2007)","journal-title":"The VLDB Journal"},{"key":"45_CR8","doi-asserted-by":"crossref","unstructured":"Guibas, L.J., Salesin, D., Stolfi, J.: Epsilon geometry: building robust algorithms from imprecise computations. In: SoCG (1989)","DOI":"10.1145\/73833.73857"},{"key":"45_CR9","doi-asserted-by":"crossref","unstructured":"Held, M., Mitchell, J.S.B.: Triangulating input-constrained planar point sets. Information Processing Letters\u00a0109(1) (2008)","DOI":"10.1016\/j.ipl.2008.09.016"},{"key":"45_CR10","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. Journal of Computer and System Sciences\u00a062, 516\u2013527 (2001)","journal-title":"Journal of Computer and System Sciences"},{"key":"45_CR11","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/978-3-642-04128-0_29","volume-title":"Algorithms - ESA 2009","author":"M. L\u00f6ffler","year":"2009","unstructured":"L\u00f6ffler, M., Phillips, J.M.: Shape fitting on point sets with probability distributions. In: Fiat, A., Sanders, P. (eds.) ESA 2009. LNCS, vol.\u00a05757, pp. 313\u2013324. Springer, Heidelberg (2009)"},{"key":"45_CR12","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":"45_CR13","doi-asserted-by":"crossref","unstructured":"Sharir, M., Welzl, E.: A combinatorial bound for linear programming and related problems. In: STACS (1992)","DOI":"10.1007\/3-540-55210-3_213"},{"key":"45_CR14","unstructured":"Tao, Y., Cheng, R., Xiao, X., Ngai, W.K., Kao, B., Prabhakar, S.: Indexing multi-dimensional uncertain data with arbitrary probability density functions. In: VLDB (2005)"},{"key":"45_CR15","doi-asserted-by":"publisher","first-page":"410","DOI":"10.1137\/0208032","volume":"8","author":"L.G. Valiant","year":"1979","unstructured":"Valiant, L.G.: The complexity of enumeration and reliability problems. SIAM Journal on Computing\u00a08, 410\u2013421 (1979)","journal-title":"SIAM Journal on Computing"},{"key":"45_CR16","doi-asserted-by":"publisher","first-page":"419","DOI":"10.1016\/j.comgeo.2009.03.007","volume":"43","author":"M. Kreveld van","year":"2010","unstructured":"van Kreveld, M., L\u00f6ffler, M.: Largest bounding box, smallest diameter, and related problems on imprecise points. Computational Geometry: Theory and Applications\u00a043, 419\u2013433 (2010)","journal-title":"Computational Geometry: Theory and Applications"},{"key":"45_CR17","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. Theory of Probability and its Applications\u00a016, 264\u2013280 (1971)","journal-title":"Theory of Probability and its Applications"},{"key":"45_CR18","doi-asserted-by":"crossref","unstructured":"Zou, Y., Chakrabarty, K.: Uncertainty-aware and coverage-oriented deployment of sensor networks. Journal of Parallel and Distributed Computing (2004)","DOI":"10.1016\/j.jpdc.2004.03.019"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22300-6_45","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,13]],"date-time":"2019-06-13T22:54:03Z","timestamp":1560466443000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22300-6_45"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642222993","9783642223006"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22300-6_45","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}