{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,8]],"date-time":"2026-04-08T12:08:31Z","timestamp":1775650111056,"version":"3.50.1"},"publisher-location":"Cham","reference-count":27,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030046507","type":"print"},{"value":"9783030046514","type":"electronic"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04651-4_32","type":"book-chapter","created":{"date-parts":[[2018,11,15]],"date-time":"2018-11-15T19:56:50Z","timestamp":1542311810000},"page":"480-494","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Exact and Approximate Map-Reduce Algorithms for Convex Hull"],"prefix":"10.1007","author":[{"given":"Anirban","family":"Ghosh","sequence":"first","affiliation":[]},{"given":"Samuel","family":"Schwartz","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,16]]},"reference":[{"key":"32_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Fox, K., Munagala, K., Nath, A.: Parallel algorithms for constructing range and nearest-neighbor searching data structures. In: Proceedings of the 35th ACM SIGMOD-SIGACT-SIGAI Symposium on Principles of Database Systems, pp. 429\u2013440 (2016)","DOI":"10.1145\/2902251.2902303"},{"key":"32_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"675","DOI":"10.1007\/978-3-319-94776-1_56","volume-title":"Computing and Combinatorics","author":"S Aghamolaei","year":"2018","unstructured":"Aghamolaei, S., Baharifard, F., Ghodsi, M.: Geometric spanners in the MapReduce model. In: Wang, L., Zhu, D. (eds.) COCOON 2018. LNCS, vol. 10976, pp. 675\u2013687. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-319-94776-1_56"},{"key":"32_CR3","unstructured":"Akl, S.G., Toussaint, G.T.: Efficient convex hull algorithms for pattern recognition applications. In: Proceedings of the 4th International Joint Conference on Pattern Recognition, pp. 483\u2013487 (1979)"},{"issue":"5","key":"32_CR4","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0020-0190(79)90072-3","volume":"9","author":"AM Andrew","year":"1979","unstructured":"Andrew, A.M.: Another efficient algorithm for convex hulls in two dimensions. Inform. Process. Lett. 9(5), 216\u2013219 (1979)","journal-title":"Inform. Process. Lett."},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Andoni, A., Nikolov, A., Onak, K., Yaroslavtsev, G.: Parallel algorithms for geometric graph problems. In: Proceedings of the 46th Annual ACM Symposium on Theory of Computing, pp. 574\u2013583 (2014)","DOI":"10.1145\/2591796.2591805"},{"issue":"6","key":"32_CR6","doi-asserted-by":"publisher","first-page":"296","DOI":"10.1016\/0020-0190(78)90021-2","volume":"7","author":"A Bykat","year":"1978","unstructured":"Bykat, A.: Convex hull of a finite set of points in two dimensions. Inform. Process. Lett. 7(6), 296\u2013298 (1978)","journal-title":"Inform. Process. Lett."},{"issue":"4","key":"32_CR7","doi-asserted-by":"publisher","first-page":"361","DOI":"10.1007\/BF02712873","volume":"16","author":"TM Chan","year":"1996","unstructured":"Chan, T.M.: Optimal output-sensitive convex hull algorithms in two and three dimensions. Discrete Comput. Geom. 16(4), 361\u2013368 (1996)","journal-title":"Discrete Comput. Geom."},{"issue":"1","key":"32_CR8","doi-asserted-by":"publisher","first-page":"107","DOI":"10.1145\/1327452.1327492","volume":"51","author":"J Dean","year":"2008","unstructured":"Dean, J., Ghemawat, S.: MapReduce: simplified data processing on large clusters. Commun. ACM 51(1), 107\u2013113 (2008)","journal-title":"Commun. ACM"},{"issue":"4","key":"32_CR9","doi-asserted-by":"publisher","first-page":"398","DOI":"10.1145\/355759.355766","volume":"3","author":"WF Eddy","year":"1977","unstructured":"Eddy, W.F.: A new convex hull algorithm for planar sets. ACM Trans. Math. Softw. 3(4), 398\u2013403 (1977)","journal-title":"ACM Trans. Math. Softw."},{"key":"32_CR10","doi-asserted-by":"crossref","unstructured":"Eldawy, A., Li, Y., Mokbel, M.F., Janardan, R.: CG$$\\_$$Hadoop: computational geometry in MapReduce. In: Proceedings of the 21st ACM SIGSPATIAL International Conference on Advances in Geographic Information Systems, pp. 294\u2013303 (2013)","DOI":"10.1145\/2525314.2525349"},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Ene, A., Im, S., Moseley, B.: Fast clustering using MapReduce. In: Proceedings of the 17th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 681\u2013689 (2011)","DOI":"10.1145\/2020408.2020515"},{"key":"32_CR12","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/2794080","volume":"20","author":"I Finocchi","year":"2015","unstructured":"Finocchi, I., Finocchi, M., Fusco, E.G.: Clique counting in MapReduce: algorithms and experiments. ACM J. Exp. Algorithmics 20, 1\u20137 (2015)","journal-title":"ACM J. Exp. Algorithmics"},{"key":"32_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"374","DOI":"10.1007\/978-3-642-25591-5_39","volume-title":"Algorithms and Computation","author":"MT Goodrich","year":"2011","unstructured":"Goodrich, M.T., Sitchinava, N., Zhang, Q.: Sorting, searching, and simulation in the MapReduce framework. In: Asano, T., Nakano, S., Okamoto, Y., Watanabe, O. (eds.) ISAAC 2011. LNCS, vol. 7074, pp. 374\u2013383. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-25591-5_39"},{"issue":"4","key":"32_CR14","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"RL Graham","year":"1972","unstructured":"Graham, R.L.: An efficient algorithm for determining the convex hull of a finite planar set. Inform. Process. Lett. 1(4), 132\u2013133 (1972)","journal-title":"Inform. Process. Lett."},{"key":"32_CR15","unstructured":"hadoop.apache.org"},{"issue":"1","key":"32_CR16","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1016\/0020-0190(73)90020-3","volume":"2","author":"RA Jarvis","year":"1973","unstructured":"Jarvis, R.A.: On the identification of the convex hull of a finite set of points in the plane. Inform. Process. Lett. 2(1), 18\u201321 (1973)","journal-title":"Inform. Process. Lett."},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Karloff, H., Suri, S., Vassilvitskii, S.: A model of computation for MapReduce. In: Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 938\u2013948. Society for Industrial and Applied Mathematics (2010)","DOI":"10.1137\/1.9781611973075.76"},{"issue":"1","key":"32_CR18","doi-asserted-by":"publisher","first-page":"18","DOI":"10.1137\/0215021","volume":"15","author":"DG Kirkpatrick","year":"1986","unstructured":"Kirkpatrick, D.G., Seidel, R.: The ultimate planar convex hull algorithm? SIAM J. Comput. 15(1), 18\u201321 (1986)","journal-title":"SIAM J. Comput."},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Lattanzi, S., Moseley, B., Suri, S., Vassilvitskii, S.: Filtering: a method for solving graph problems in MapReduce. In: Proceedings of the Twenty-Third Annual ACM Symposium on Parallelism in Algorithms and Architectures, pp. 85\u201394 (2011)","DOI":"10.1145\/1989493.1989505"},{"key":"32_CR20","volume-title":"Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis","author":"M Mitzenmacher","year":"2017","unstructured":"Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomization and Probabilistic Techniques in Algorithms and Data Analysis. Cambridge University Press, Cambridge (2017)"},{"issue":"2","key":"32_CR21","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/359423.359430","volume":"20","author":"FP Preparata","year":"1977","unstructured":"Preparata, F.P., Hong, S.J.: Convex hulls of finite sets of points in two and three dimensions. Commun. ACM 20(2), 87\u201393 (1977)","journal-title":"Commun. ACM"},{"key":"32_CR22","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). https:\/\/doi.org\/10.1007\/978-1-4612-1098-6"},{"key":"32_CR23","doi-asserted-by":"publisher","first-page":"35","DOI":"10.2307\/3212146","volume":"7","author":"H Raynaud","year":"1970","unstructured":"Raynaud, H.: Sur l\u2019enveloppe convex des nuages de points aleatoires dans $$R^{n}$$. J. Appl. Probab. 7, 35\u201348 (1970)","journal-title":"J. Appl. Probab."},{"key":"32_CR24","doi-asserted-by":"publisher","first-page":"75","DOI":"10.1007\/BF00535300","volume":"2","author":"A R\u00e9nyi","year":"1963","unstructured":"R\u00e9nyi, A., Sulanke, R.: \u00dcber die konvexe H\u00fclle von $$n$$ zuf\u00e4llig gerw\u00e4hten Punkten I. Z. Wahrsch. Verw. Gebiete 2, 75\u201384 (1963)","journal-title":"Z. Wahrsch. Verw. Gebiete"},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"Soisalon-Soininen, E.: On computing approximate convex hulls. Inform. Process. Lett. 16(3), 121\u2013126 (1983). A correction to this paper appeared in Inform. Process. Lett. 22, 55\u201356 (1986). coauthored by Ivan Stojmenovi\u0107","DOI":"10.1016\/0020-0190(83)90062-5"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Suri, S., Vassilvitskii, S.: Counting triangles and the curse of the last reducer. In: Proceedings of the 20th International Conference on World Wide Web, pp. 607\u2013614 (2011)","DOI":"10.1145\/1963405.1963491"},{"key":"32_CR27","unstructured":"Yaroslavtsev, G., Vadapalli, A.: Massively parallel algorithms and hardness for single-linkage clustering under $$\\ell $$$$_{p}$$-distances, arXiv:1710.01431 (2017)"}],"container-title":["Lecture Notes in Computer Science","Combinatorial Optimization and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04651-4_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:50:22Z","timestamp":1710345022000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04651-4_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030046507","9783030046514"],"references-count":27,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04651-4_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"16 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"COCOA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Combinatorial Optimization and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Atlanta, GA","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cocoa2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/spacl.kennesaw.edu\/cocoa2018\/cfp.html","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}