{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,30]],"date-time":"2026-07-30T06:14:05Z","timestamp":1785392045412,"version":"3.55.0"},"publisher-location":"Berlin, Heidelberg","reference-count":19,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642404498","type":"print"},{"value":"9783642404504","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2013]]},"DOI":"10.1007\/978-3-642-40450-4_67","type":"book-chapter","created":{"date-parts":[[2013,8,15]],"date-time":"2013-08-15T23:22:47Z","timestamp":1376608967000},"page":"791-802","source":"Crossref","is-referenced-by-count":18,"title":["On the Most Likely Convex Hull of Uncertain Points"],"prefix":"10.1007","author":[{"given":"Subhash","family":"Suri","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Kevin","family":"Verbeek","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Hakan","family":"Y\u0131ld\u0131z","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"67_CR1","doi-asserted-by":"publisher","first-page":"342","DOI":"10.1007\/s00224-012-9382-7","volume":"52","author":"P. Afshani","year":"2013","unstructured":"Afshani, P., Agarwal, P.K., Arge, L., Larsen, K.G., Phillips, J.M. (Approximate) uncertain skylines. Theory Comput. Syst.\u00a052(3), 342\u2013366 (2013)","journal-title":"Theory Comput. Syst."},{"key":"67_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Cheng, S.-W., Tao, Y., Yi, K.: Indexing uncertain data. In: PODS, pp. 137\u2013146 (2009)","DOI":"10.1145\/1559795.1559816"},{"issue":"4","key":"67_CR3","doi-asserted-by":"publisher","first-page":"43","DOI":"10.1145\/2344422.2344433","volume":"8","author":"P.K. Agarwal","year":"2012","unstructured":"Agarwal, P.K., Cheng, S.-W., Yi, K.: Range searching on uncertain data. ACM Transactions on Algorithms\u00a08(4), 43 (2012)","journal-title":"ACM Transactions on Algorithms"},{"key":"67_CR4","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.C.: Managing and Mining Uncertain Data. Advances in Database Systems, vol.\u00a035. Kluwer (2009)","DOI":"10.1007\/978-0-387-09690-2"},{"issue":"5","key":"67_CR5","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TKDE.2008.190","volume":"21","author":"C.C. Aggarwal","year":"2009","unstructured":"Aggarwal, C.C., Yu, P.S.: A survey of uncertain data algorithms and applications. IEEE Trans. Knowl. Data Eng.\u00a021(5), 609\u2013623 (2009)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"67_CR6","doi-asserted-by":"crossref","unstructured":"Avis, D., Rappaport, D.: Computing the largest empty convex subset of a set of points. In: Proc. of the 1st Symp. on Comput. Geometry, pp. 161\u2013167 (1985)","DOI":"10.1145\/323233.323255"},{"issue":"4","key":"67_CR7","doi-asserted-by":"publisher","first-page":"246","DOI":"10.1016\/j.orl.2011.04.008","volume":"39","author":"C. Bautista-Santiago","year":"2011","unstructured":"Bautista-Santiago, C., D\u00edaz-B\u00e1\u00f1ez, J.M., Lara, D., P\u00e9rez-Lantero, P., Urrutia, J., Ventura, I.: Computing optimal islands. Op. Res. Letters\u00a039(4), 246\u2013251 (2011)","journal-title":"Op. Res. Letters"},{"key":"67_CR8","doi-asserted-by":"publisher","first-page":"73","DOI":"10.1016\/j.endm.2004.06.012","volume":"18","author":"M.R. Cerioli","year":"2004","unstructured":"Cerioli, M.R., Faria, L., Ferreira, T.O., Protti, F.: On minimum clique partition and maximum independent set on unit disk graphs and penny graphs: Complexity and approximation. Electronic Notes in Discrete Mathematics\u00a018, 73\u201379 (2004)","journal-title":"Electronic Notes in Discrete Mathematics"},{"key":"67_CR9","first-page":"453","volume":"29","author":"V. Chv\u00e1tal","year":"1980","unstructured":"Chv\u00e1tal, V., Klincsek, G.: Finding largest convex subsets. Congresus Numeratium\u00a029, 453\u2013460 (1980)","journal-title":"Congresus Numeratium"},{"key":"67_CR10","doi-asserted-by":"crossref","unstructured":"Cormode, G., McGregor, A.: Approximation algorithms for clustering uncertain data. In: Proc. 27th Symp. on Principles of Database Systems, pp. 191\u2013200 (2008)","DOI":"10.1145\/1376916.1376944"},{"issue":"1","key":"67_CR11","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/BF02187823","volume":"7","author":"D. Eppstein","year":"1992","unstructured":"Eppstein, D., Overmars, M., Rote, G., Woeginger, G.: Finding minimum area k-gons. Discrete & Computational Geometry\u00a07(1), 45\u201358 (1992)","journal-title":"Discrete & Computational Geometry"},{"key":"67_CR12","doi-asserted-by":"crossref","unstructured":"Getz, W.M., Fortmann-Roe, S., Cross, P.C., Lyons, A.J., Ryan, S.J., Wilmers, C.C.: Locoh: Nonparameteric kernel methods for constructing home ranges and utilization distr ibutions. PLoS ONE\u00a02(2), 02 (2007)","DOI":"10.1371\/journal.pone.0000207"},{"issue":"4","key":"67_CR13","doi-asserted-by":"publisher","first-page":"489","DOI":"10.1111\/j.0906-7590.2004.03835.x","volume":"27","author":"W.M. Getz","year":"2004","unstructured":"Getz, W.M., Wilmers, C.C.: A local nearest-neighbor convex-hull construction of home ranges and utilization distributions. Ecography\u00a027(4), 489\u2013505 (2004)","journal-title":"Ecography"},{"key":"67_CR14","unstructured":"J\u00f8rgensen, A., L\u00f6ffler, M., Phillips, J.M.: Geometric computations on indecisive and uncertain points. CoRR, abs\/1205.0273 (2012)"},{"key":"67_CR15","doi-asserted-by":"crossref","unstructured":"Kettner, L., Mehlhorn, K., Pion, S., Schirra, S., Yap, C.-K.: Classroom examples of robustness problems in geometric computations. Comput. Geom.\u00a040(1) (2008)","DOI":"10.1016\/j.comgeo.2007.06.003"},{"key":"67_CR16","unstructured":"L\u00f6ffler, M.: Data Imprecision in Computational Geometry. PhD thesis, Utrecht University (2009)"},{"key":"67_CR17","doi-asserted-by":"publisher","first-page":"235","DOI":"10.1007\/s00453-008-9174-2","volume":"56","author":"M. L\u00f6ffler","year":"2010","unstructured":"L\u00f6ffler, M., van Kreveld, M.: Largest and smallest convex hulls for imprecise points. Algorithmica\u00a056, 235\u2013269 (2010)","journal-title":"Algorithmica"},{"key":"67_CR18","doi-asserted-by":"crossref","unstructured":"Salesin, D., Stolfi, J., Guibas, L.J.: Epsilon geometry: Building robust algorithms from imprecise computations. In: Symp. on Comput. Geom., pp. 208\u2013217 (1989)","DOI":"10.1145\/73833.73857"},{"key":"67_CR19","doi-asserted-by":"crossref","unstructured":"Yap, C.-K., Pion, S.: Special issue on robust geometric algorithms and their implementations. Comput. Geom.\u00a033(1-2) (2006)","DOI":"10.1016\/j.comgeo.2005.08.001"}],"container-title":["Lecture Notes in Computer Science","Algorithms \u2013 ESA 2013"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-40450-4_67","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,16]],"date-time":"2019-05-16T12:57:38Z","timestamp":1558011458000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-40450-4_67"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642404498","9783642404504"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-40450-4_67","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2013]]}}}