{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,14]],"date-time":"2025-10-14T11:37:33Z","timestamp":1760441853020},"publisher-location":"Berlin, Heidelberg","reference-count":28,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783662495285"},{"type":"electronic","value":"9783662495292"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"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":[[2016]]},"DOI":"10.1007\/978-3-662-49529-2_43","type":"book-chapter","created":{"date-parts":[[2016,3,21]],"date-time":"2016-03-21T08:09:41Z","timestamp":1458547781000},"page":"576-589","source":"Crossref","is-referenced-by-count":0,"title":["Containment and Evasion in Stochastic Point Data"],"prefix":"10.1007","author":[{"given":"Nirman","family":"Kumar","sequence":"first","affiliation":[]},{"given":"Subhash","family":"Suri","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,3,22]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Abdullah, A., Daruki, S., Phillips, J.M.: Range counting coresets for uncertain data. In: Proceedings of the 29th Annual Symposium Computational Geometry, pp. 223\u2013232. ACM (2013)","key":"43_CR1","DOI":"10.1145\/2493132.2462388"},{"issue":"3","key":"43_CR2","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. 52(3), 342\u2013366 (2013)","journal-title":"Theory Comput. Syst."},{"doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Aronov, B., Har-Peled, S., Phillips, J.M., Yi, K., Zhang, W.: Nearest neighbor searching under uncertainty II. In: Proceedings of the 32nd ACM Symposium Principles Database Systems, pp. 115\u2013126 (2013)","key":"43_CR3","DOI":"10.1145\/2463664.2465219"},{"issue":"4","key":"43_CR4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/2344422.2344433","volume":"8","author":"Pankaj K. Agarwal","year":"2012","unstructured":"Agarwal, P.K., Cheng, S.W., Yi, K.: Range searching on uncertain data. ACM Trans. Algorithms 8(4), 43:1\u201343:17 (2012)","journal-title":"ACM Transactions on Algorithms"},{"doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Efrat, A., Sankararaman, S., Zhang, W.: Nearest-neighbor searching under uncertainty. In: Proceedings of the 31st ACM Symposium Principles Database Systems, pp. 225\u2013236. ACM (2012)","key":"43_CR5","DOI":"10.1145\/2213556.2213588"},{"doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Har-Peled, S., Suri, S., Y\u0131ld\u0131z, H., Zhang, W.: Convex hulls under uncertainty. In: Proceedings of the 22nd Annual European Symposium on Algorithms, pp. 37\u201348 (2014)","key":"43_CR6","DOI":"10.1007\/978-3-662-44777-2_4"},{"key":"43_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-09690-2","volume-title":"Managing and Mining Uncertain Data","author":"CC Aggarwal","year":"2009","unstructured":"Aggarwal, C.C.: Managing and Mining Uncertain Data. Springer, US (2009)"},{"issue":"5","key":"43_CR8","doi-asserted-by":"publisher","first-page":"609","DOI":"10.1109\/TKDE.2008.190","volume":"21","author":"CC Aggarwal","year":"2009","unstructured":"Aggarwal, C.C., Yu, P.S.: A survey of uncertain data algorithms and applications. IEEE Trans. Knowl. Data Eng. 21(5), 609\u2013623 (2009)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"43_CR9","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-77974-2","volume-title":"Computational Geometry: Algorithms and Applications","author":"M Berg de","year":"2008","unstructured":"de Berg, M., Cheong, O., van Kreveld, M., Overmars, M.: Computational Geometry: Algorithms and Applications, 3rd edn. Springer, Heidelberg (2008)","edition":"3"},{"unstructured":"Chazelle, B.: The polygon containment problem. In: Preparata, F.P. (ed.) Advances in Computing Research, vol. 1, pp. 1\u201333. JAI Press (1983)","key":"43_CR10"},{"issue":"4","key":"43_CR11","doi-asserted-by":"publisher","first-page":"299","DOI":"10.1007\/s10514-011-9241-4","volume":"31","author":"TH Chung","year":"2011","unstructured":"Chung, T.H., Hollinger, G.A., Isler, V.: Search and pursuit-evasion in mobile robotics-A survey. Auton. Robots 31(4), 299\u2013316 (2011)","journal-title":"Auton. Robots"},{"key":"43_CR12","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/0020-0190(86)90037-2","volume":"22","author":"KL Clarkson","year":"1986","unstructured":"Clarkson, K.L.: Linear programming in \n                    \n                      \n                    \n                    $$o(n3^{d^2})$$\n                    \n                      \n                        \n                          o\n                          (\n                          n\n                          \n                            3\n                            \n                              d\n                              2\n                            \n                          \n                          )\n                        \n                      \n                    \n                   time. Inform. Process. Lett. 22, 21\u201324 (1986)","journal-title":"Inform. Process. Lett."},{"key":"43_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-3-642-40705-5_1","volume-title":"Partially Supervised Learning","author":"GBP Costa","year":"2013","unstructured":"Costa, G.B.P., Ponti, M., Frery, A.C.: Partially supervised anomaly detection using convex hulls on a 2D parameter space. In: Zhou, Z.-H., Schwenker, F. (eds.) PSL 2013. LNCS, vol. 8183, pp. 1\u20138. Springer, Heidelberg (2013)"},{"issue":"7","key":"43_CR14","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1145\/1538788.1538810","volume":"52","author":"N Dalvi","year":"2009","unstructured":"Dalvi, N., R\u00e9, C., Suciu, D.: Probabilistic databases: diamonds in the dirt. Commun. ACM 52(7), 86\u201394 (2009)","journal-title":"Commun. ACM"},{"issue":"3","key":"43_CR15","doi-asserted-by":"publisher","first-page":"123","DOI":"10.1016\/S0925-7721(97)00006-0","volume":"8","author":"G Das","year":"1997","unstructured":"Das, G., Goodrich, M.T.: On the complexity of optimization problems for 3-dimensional convex polyhedra and decision trees. Comput. Geom. Theory Appl. 8(3), 123\u2013137 (1997)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"43_CR16","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 \n                    \n                      \n                    \n                    $$k$$\n                    \n                      \n                        k\n                      \n                    \n                  -gons. Discrete Comput. Geom. 7(1), 45\u201358 (1992)","journal-title":"Discrete Comput. Geom."},{"unstructured":"Fink, M., Hershberger, J., Kumar, N., Suri, S.: Hyperplane separability and convexity of probabilistic points (2015) (unpublished manuscript)","key":"43_CR17"},{"unstructured":"J\u00f8rgensen, A., L\u00f6ffler, M., Phillips, J.M.: Geometric computations on indecisive and uncertain points. CoRR abs\/1205.0273 (2012)","key":"43_CR18"},{"doi-asserted-by":"crossref","unstructured":"Kamousi, P., Chan, T.M., Suri, S.: Stochastic minimum spanning trees in Euclidean spaces. In: Proceedings of the 27th Annual Symposium Computational Geometry, pp. 65\u201374 (2011)","key":"43_CR19","DOI":"10.1145\/1998196.1998206"},{"issue":"2","key":"43_CR20","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/j.comgeo.2012.10.010","volume":"47","author":"P Kamousi","year":"2014","unstructured":"Kamousi, P., Chan, T.M., Suri, S.: Closest pair and the post office problem for stochastic points. Comput. Geom. Theory Appl. 47(2), 214\u2013223 (2014)","journal-title":"Comput. Geom. Theory Appl."},{"issue":"1","key":"43_CR21","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N Megiddo","year":"1984","unstructured":"Megiddo, N.: Linear programming in linear time when the dimension is fixed. J. ACM 31(1), 114\u2013127 (1984)","journal-title":"J. ACM"},{"doi-asserted-by":"crossref","unstructured":"Milenkovic, V.J.: Translational polygon containment and minimal enclosure using linear programming based restriction. In: Proceedings of the 28th Annual ACM Symposium on Theory of Computing, pp. 109\u2013118. ACM (1996)","key":"43_CR22","DOI":"10.1145\/237814.237840"},{"key":"43_CR23","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6","volume-title":"Computational Geometry: An Introduction","author":"FP Preparata","year":"1985","unstructured":"Preparata, F.P., Shamos, M.I.: Computational Geometry: An Introduction. Springer, New York (1985)"},{"issue":"5","key":"43_CR24","doi-asserted-by":"publisher","first-page":"989","DOI":"10.1007\/s00778-009-0147-0","volume":"18","author":"AD Sarma","year":"2009","unstructured":"Sarma, A.D., Benjelloun, O., Halevy, A.Y., Nabar, S.U., Widom, J.: Representing uncertain data: models, properties, and algorithms. VLDB J. 18(5), 989\u20131019 (2009)","journal-title":"VLDB J."},{"key":"43_CR25","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1007\/978-3-319-13075-0_27","volume-title":"Algorithms and Computation","author":"S Suri","year":"2014","unstructured":"Suri, S., Verbeek, K.: On the most likely voronoi diagram and nearest neighbor searching. In: Ahn, H.-K., Shin, C.-S. (eds.) ISAAC 2014. LNCS, vol. 8889, pp. 338\u2013350. Springer, Heidelberg (2014)"},{"key":"43_CR26","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1007\/978-3-642-40450-4_67","volume-title":"Algorithms \u2013 ESA 2013","author":"S Suri","year":"2013","unstructured":"Suri, S., Verbeek, K., Y\u0131ld\u0131z, H.: On the most likely convex hull of uncertain points. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 791\u2013802. Springer, Heidelberg (2013)"},{"issue":"2","key":"43_CR27","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1137\/S0097539797321602","volume":"31","author":"SP Vadhan","year":"2001","unstructured":"Vadhan, S.P.: The complexity of counting in sparse, regular, and planar graphs. SIAM J. Comput. 31(2), 398\u2013427 (2001)","journal-title":"SIAM J. Comput."},{"key":"43_CR28","series-title":"Graduate Texts in Mathematics","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4613-8431-1","volume-title":"Lectures on Polytopes","author":"GM Ziegler","year":"1995","unstructured":"Ziegler, G.M.: Lectures on Polytopes. Graduate Texts in Mathematics. Springer, New York (1995)"}],"container-title":["Lecture Notes in Computer Science","LATIN 2016: Theoretical Informatics"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-662-49529-2_43","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T20:18:35Z","timestamp":1559420315000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-662-49529-2_43"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783662495285","9783662495292"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-662-49529-2_43","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2016]]}}}