{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,4]],"date-time":"2024-09-04T21:45:21Z","timestamp":1725486321620},"reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540108276"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/bfb0105130","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T05:24:42Z","timestamp":1181625882000},"page":"358-372","source":"Crossref","is-referenced-by-count":6,"title":["Parallel algorithms for the convex hull problem in two dimensions"],"prefix":"10.1007","author":[{"given":"Dhruva","family":"Nath","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"S. N.","family":"Maheshwari","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. C. P.","family":"Bhatt","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"25_CR1","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1016\/0020-0190(79)90072-3","volume":"9","author":"A.M. Andrew","year":"1979","unstructured":"Andrew, A.M. \u2018Another efficient algorithm for Convex Hulls in two dimensions', Inf. Proc. Letters 9(1979) pp. 216\u2013219.","journal-title":"Inf. Proc. Letters"},{"key":"25_CR2","first-page":"307","volume":"32","author":"K.E. Batcher","year":"1968","unstructured":"Batcher, K.E., \u2018Sorting Networks and their applications', Proc. AFIPS SJCC, vol. 32, 1968, pp. 307\u2013314.","journal-title":"Proc. AFIPS SJCC"},{"issue":"7","key":"25_CR3","doi-asserted-by":"crossref","first-page":"409","DOI":"10.1145\/360881.360919","volume":"18","author":"H. Freeman","year":"1975","unstructured":"Freeman, H., and Shapira, R. \u2018Determining the minimum area incasing rectangle for an arbitrary closed curve, CACM 18, 7 (July 1975), pp. 409\u2013413.","journal-title":"CACM"},{"key":"25_CR4","unstructured":"Gavril, F. \u2018Adaptive Merging by Parallel Disjoint Comparisons', presented at the 1975 Conference on Information Sciences and Systems."},{"issue":"8","key":"25_CR5","doi-asserted-by":"crossref","first-page":"657","DOI":"10.1145\/359576.359582","volume":"21","author":"D.S. Hirschberg","year":"1978","unstructured":"Hirschberg, D.S. \u2018Fast parallel sorting schemes', CACM 21, 8 (Aug. 1978), pp. 657\u2013661.","journal-title":"CACM"},{"key":"25_CR6","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1016\/S0022-0000(73)80043-1","volume":"7","author":"I. Munro","year":"1973","unstructured":"Munro, I., and Paterson, M. \u2018Optimal algorithms for parallel polynomial evaluation', J. Comp. Sys. Sci. 7(1973), pp. 183\u2013198.","journal-title":"J. Comp. Sys. Sci."},{"key":"25_CR7","unstructured":"Nassimi, D. and Sahni, S. \u2018Data Broadcasting in SIMD computers', Tech. Rep., University of Minnesota, June 1979."},{"key":"25_CR8","doi-asserted-by":"crossref","first-page":"669","DOI":"10.1109\/TC.1978.1675167","volume":"C-27","author":"F.P. Preparata","year":"1978","unstructured":"Preparata, F.P. \u2018New Parallel Sorting Schemes', IEEE Trans. Comp., C-27 (July 1978) pp. 669\u2013673.","journal-title":"IEEE Trans. Comp."},{"issue":"2","key":"25_CR9","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","volume":"20","author":"F.P. Preparata","year":"1977","unstructured":"Preparata, F.P. and Hong, S.J. \u2018Convex Hulls of Finite Sets of Points in Two and Three Dimensions', CACM 20, 2(Feb. 1977), pp. 87\u201393.","journal-title":"CACM"},{"issue":"7","key":"25_CR10","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1145\/359131.359132","volume":"22","author":"F.P. Preparata","year":"1979","unstructured":"Preparata, F.P. \u2018An Optinal Real-Time Algorithm for Planar Convex Hulls', CACM 22, 7 (July 1979), pp. 402\u2013405.","journal-title":"CACM"},{"key":"25_CR11","volume-title":"Parallel algorithms for graph theoretic problems","author":"C.D. Savage","year":"1977","unstructured":"Savage, C.D. \u2018Parallel algorithms for graph theoretic problems', Ph. D. Thesis, University of Illinois, Urbana, Aug. 1977."},{"key":"25_CR12","doi-asserted-by":"crossref","unstructured":"Shamos, M.I., \u2018Geometric Complexity', Proc. 7th Annual ACM Symp. on Theory of Comp., May 1975, pp. 224\u2013233.","DOI":"10.1145\/800116.803772"}],"container-title":["Lecture Notes in Computer Science","Conpar 81"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0105130.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,12,9]],"date-time":"2020-12-09T22:18:53Z","timestamp":1607552333000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BFb0105130"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540108276"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/bfb0105130","relation":{},"subject":[]}}