{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:15:31Z","timestamp":1758824131842},"reference-count":25,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[2003,4,1]],"date-time":"2003-04-01T00:00:00Z","timestamp":1049155200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[2003,4]]},"DOI":"10.1016\/s0743-7315(03)00035-2","type":"journal-article","created":{"date-parts":[[2003,6,21]],"date-time":"2003-06-21T02:57:13Z","timestamp":1056164233000},"page":"488-500","source":"Crossref","is-referenced-by-count":6,"title":["Faster output-sensitive parallel algorithms for 3D convex hulls and vector maxima"],"prefix":"10.1016","volume":"63","author":[{"given":"Neelima","family":"Gupta","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sandeep","family":"Sen","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0743-7315(03)00035-2_BIBAGR94","doi-asserted-by":"crossref","unstructured":"N.M. Amato, M.T. Goodrich, E.A. Ramos, Parallel algorithms for higher-dimensional convex hulls, Proceedings of the 35th Annual FOCS, Santa Fe, NM, 1994, pp. 683\u2013694.","DOI":"10.1109\/SFCS.1994.365724"},{"issue":"2","key":"10.1016\/S0743-7315(03)00035-2_BIBAP92","doi-asserted-by":"crossref","first-page":"163","DOI":"10.1142\/S021819599200010X","article-title":"The parallel 3d convex hull problem revisited","volume":"2","author":"Amato","year":"1992","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0743-7315(03)00035-2_BIBAR96","doi-asserted-by":"crossref","unstructured":"N.M. Amato, E.M. Ramos, On computing vornoi diagrams by divide-prune-and-conquer, ACM Symposium on Computational Geometry, Vol. 12, Philadelphia, PA, 1996, pp. 166\u2013175.","DOI":"10.1145\/237218.237347"},{"key":"10.1016\/S0743-7315(03)00035-2_BIBACG89","doi-asserted-by":"crossref","first-page":"499","DOI":"10.1137\/0218035","article-title":"Cascading divide-and-conquer","volume":"18","author":"Atallah","year":"1989","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0743-7315(03)00035-2_BIBBH93","doi-asserted-by":"crossref","unstructured":"H. Bast, T. Hagerup, Fast parallel space allocation, estimation and integer sorting, Technical Report, MPI-I-93-123, 1993.","DOI":"10.1006\/inco.1995.1159"},{"key":"10.1016\/S0743-7315(03)00035-2_BIBBRE74","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1145\/321812.321815","article-title":"Parallel evaluation of general arithmetic expressions","volume":"21","author":"Brent","year":"1974","journal-title":"J. ACM"},{"key":"10.1016\/S0743-7315(03)00035-2_BIBCHA95","doi-asserted-by":"crossref","unstructured":"T.M. Chan, Output-sensitive results on convex hulls, extreme points and related problems, ACM Symposium on Computational Geometry, 1995.","DOI":"10.1145\/220279.220281"},{"key":"10.1016\/S0743-7315(03)00035-2_BIBCM92","unstructured":"B. Chazelle, J. Matou\u0161ek, Derandomizing an output-sensitive convex-hull algorithm in three dimensions, Tech. Report, Princeton University, 1992."},{"key":"10.1016\/S0743-7315(03)00035-2_BIBCHO80","unstructured":"A. Chow, Parallel algorithms for geometric problems, Ph.D. Thesis, University of Illinois, Urbana-Champaign, 1980."},{"key":"10.1016\/S0743-7315(03)00035-2_BIBCS89","doi-asserted-by":"crossref","first-page":"387","DOI":"10.1007\/BF02187740","article-title":"Applications of random sampling in computational geometry ii","volume":"4","author":"Clarkson","year":"1989","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0743-7315(03)00035-2_BIBDK89","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0022-0000(89)90042-1","article-title":"Parallel construction of subdivision hierarchies","volume":"39","author":"Dadoun","year":"1989","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/S0743-7315(03)00035-2_BIBGG91","doi-asserted-by":"crossref","unstructured":"M. Ghouse, M.T. Goodrich, In-place techniques for parallel convex-hull algorithm, Proceedings of the Third ACM Symposium on Parallel Algorithms Architecture, Hilton Head, SC, 1991, pp. 192\u2013203.","DOI":"10.1145\/113379.113397"},{"key":"10.1016\/S0743-7315(03)00035-2_BIBGOO93","doi-asserted-by":"crossref","unstructured":"M.T. Goodrich, Geometric partitioning made easier, even in parallel, Proceedings of the Nineth ACM Symposium on Computational Geometry, San Diego, CA, 1993, pp. 73\u201382.","DOI":"10.1145\/160985.161002"},{"key":"10.1016\/S0743-7315(03)00035-2_BIBGS96","doi-asserted-by":"crossref","unstructured":"N. Gupta, S. Sen, Faster output-sensitive parallel convex hulls for d \u2a7d 3: optimal sublogarithmic algorithms for small outputs, ACM Symposium on Computational Geometry, 1996, pp. 176\u2013185.","DOI":"10.1145\/237218.237351"},{"key":"10.1016\/S0743-7315(03)00035-2_BIBGS97","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1016\/S0925-7721(97)00009-6","article-title":"Optimal, output-sensitive algorithms for constructing planar hulls in parallel","volume":"8","author":"Gupta","year":"1997","journal-title":"Comput. Geom.: Theory Appl."},{"key":"10.1016\/S0743-7315(03)00035-2_BIBHR92","first-page":"628","article-title":"Waste makes haste","volume":"33","author":"Hagerup","year":"1992","journal-title":"FOCS"},{"issue":"2","key":"10.1016\/S0743-7315(03)00035-2_BIBHW87","doi-asserted-by":"crossref","first-page":"127","DOI":"10.1007\/BF02187876","article-title":"\u03b5-nets and simplex range queries","volume":"2","author":"Haussler","year":"1987","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0743-7315(03)00035-2_BIBKET94","series-title":"Computational Geometry: An Introduction through Randomized Algorithms","author":"Ketan","year":"1994"},{"issue":"1","key":"10.1016\/S0743-7315(03)00035-2_BIBKS86","doi-asserted-by":"crossref","first-page":"287","DOI":"10.1137\/0215021","article-title":"The ultimate planar convex hull algorithm","volume":"15","author":"Kirkpatrick","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0743-7315(03)00035-2_BIBMAT92","doi-asserted-by":"crossref","unstructured":"J. Matou\u0161ek, Linear optimization queries, ACM Symposium on Computational Geometry, Vol. 8, Berlin, Germany, 1992, pp. 16\u201325.","DOI":"10.1145\/142675.142683"},{"key":"10.1016\/S0743-7315(03)00035-2_BIBPH77","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","article-title":"Convex hulls of finite sets of points in two and three dimensions","volume":"20","author":"Preparata","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/S0743-7315(03)00035-2_BIBRS93","series-title":"Random Sampling Techniques and Parallel Algorithm Design","author":"Rajasekaran","year":"1993"},{"issue":"3","key":"10.1016\/S0743-7315(03)00035-2_BIBRS92","doi-asserted-by":"crossref","first-page":"466","DOI":"10.1137\/0221031","article-title":"Optimal parallel randomized algorithms for three-dimensional convex hulls and related problems","volume":"21","author":"Reif","year":"1992","journal-title":"Siam J. Comput."},{"key":"10.1016\/S0743-7315(03)00035-2_BIBSEI86","doi-asserted-by":"crossref","unstructured":"R. Seidel, Constructing higher-dimensional convex hulls at logarithmic cost per face, Proceedings of the ACM Annual Symposium on Theory of Computing, Vol. 18, Berkeley, CA, 1986, pp. 404\u2013413.","DOI":"10.1145\/12130.12172"},{"key":"10.1016\/S0743-7315(03)00035-2_BIBSEN97","doi-asserted-by":"crossref","first-page":"59","DOI":"10.1016\/S0304-3975(96)00212-5","article-title":"Lower bounds for algebraic decision trees, parallel complexity of convex hulls and related problems","volume":"188","author":"Sen","year":"1997","journal-title":"Theoret. Comput. Sci."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731503000352?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731503000352?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2020,3,22]],"date-time":"2020-03-22T17:06:37Z","timestamp":1584896797000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731503000352"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003,4]]},"references-count":25,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2003,4]]}},"alternative-id":["S0743731503000352"],"URL":"https:\/\/doi.org\/10.1016\/s0743-7315(03)00035-2","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[2003,4]]}}}