{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,7,11]],"date-time":"2024-07-11T11:18:51Z","timestamp":1720696731117},"reference-count":37,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[1999,1,1]],"date-time":"1999-01-01T00:00:00Z","timestamp":915148800000},"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":[[1999,1]]},"DOI":"10.1006\/jpdc.1998.1503","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T15:41:49Z","timestamp":1034005309000},"page":"47-70","source":"Crossref","is-referenced-by-count":11,"title":["Scalable 2D Convex Hull and Triangulation Algorithms for Coarse Grained Multicomputers"],"prefix":"10.1006","volume":"56","author":[{"given":"Mohamadou","family":"Diallo","sequence":"first","affiliation":[]},{"given":"Afonso","family":"Ferreira","sequence":"additional","affiliation":[]},{"given":"Andrew","family":"Rau-Chaplin","sequence":"additional","affiliation":[]},{"given":"St\u00e9phane","family":"Ub\u00e9da","sequence":"additional","affiliation":[]}],"member":"78","reference":[{"key":"10.1006\/jpdc.1998.1503_RF1","doi-asserted-by":"crossref","first-page":"130","DOI":"10.1007\/BF01944471","article-title":"A constant-time parallel algorithm for computing convex hulls","volume":"22","author":"Akl","year":"1982","journal-title":"BIT"},{"key":"10.1006\/jpdc.1998.1503_RF2","series-title":"Parallel Computational Geometry","author":"Akl","year":"1993"},{"key":"10.1006\/jpdc.1998.1503_RF3","doi-asserted-by":"crossref","unstructured":"E. Anderson, J. Brooks, C. Grassl, S. Scott, Performance of the CRAY T3E Multiprocessor, Proc. Supercomputing 97, 1997","DOI":"10.1145\/509593.509632"},{"key":"10.1006\/jpdc.1998.1503_RF4","doi-asserted-by":"crossref","unstructured":"M. J. Atallah, J.-J. Tsay, On the parallel-decomposability of geometric problems, Proc. 5th Annu. ACM Sympos. Comput. Geom, 1989, 104, 113","DOI":"10.1145\/73833.73845"},{"key":"10.1006\/jpdc.1998.1503_RF5","doi-asserted-by":"crossref","unstructured":"K. E. Batcher, Sorting networks and their applications, Proc. AFIPS Spring Joint Computer Conference, 1968, 307, 314","DOI":"10.1145\/1468075.1468121"},{"key":"10.1006\/jpdc.1998.1503_RF6","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1007\/BF01188711","article-title":"Fast linear expected-time algorithms for computing maxima and convex hulls","volume":"9","author":"Bentley","year":"1993","journal-title":"Algorithmica"},{"key":"10.1006\/jpdc.1998.1503_RF7","series-title":"Parallel and Distributed Computation: Numerical Methods","author":"Bertsekas","year":"1989"},{"key":"10.1006\/jpdc.1998.1503_RF8","doi-asserted-by":"crossref","first-page":"774","DOI":"10.1109\/TC.1984.1676494","article-title":"Computational geometry on systolic chip","volume":"33","author":"Chazelle","year":"1984","journal-title":"IEEE Trans. Comput."},{"key":"10.1006\/jpdc.1998.1503_RF9","unstructured":"A. L. Chow, Parallel algorithm for determining convex hull of sets of points in two dimension, Proc. of the Nineteenth Annual Allerton Conf. on Communication, Control and Computing, 1981, 214, 223"},{"key":"10.1006\/jpdc.1998.1503_RF10","doi-asserted-by":"crossref","unstructured":"D. Culler, R. Karp, D. Patterson, A. Sahay, K. Schauser, E. Santos, R. Subrarnonian, T. von Eicken, LogP: Towards a realistic model of parallel computation, Fifth ACM SIGPLAN Symposium on the Principles and Practice of Parallel Programming, 1993, 1, 12","DOI":"10.1145\/155332.155333"},{"key":"10.1006\/jpdc.1998.1503_RF11","unstructured":"S. E. Hambrusch, A. A. Khokhar, C3, Proc. of the 6th IEEE Symposium on Parallel and Distributed Processing, October, Dallas, 1994"},{"key":"10.1006\/jpdc.1998.1503_RF12","series-title":"ACM Symposium on Theory of Computing","article-title":"Deterministic sorting in nearly logarithmic time on the hypercube and related computers","author":"Cypher","year":"1990"},{"key":"10.1006\/jpdc.1998.1503_RF13","doi-asserted-by":"crossref","unstructured":"F. Dehne, X. Deng, P. Dymond, A. Fabri, A. Khokhar, A randomized parallel 3D convex hull algorithm for coarse grained multicomputers, Proc. 7th ACM Symp. on Parallel Algorithms and Architectures, 1995, 27, 33","DOI":"10.1145\/215399.215410"},{"key":"10.1006\/jpdc.1998.1503_RF14","doi-asserted-by":"crossref","unstructured":"F. Dehne, A. Fabri, C. Kenyon, Scalable and architecture independent parallel geometric algorithms with high probability optimal time, Proceedings for the 6th IEEE SPDP, IEEE Press, New York, 1994, 586, 593","DOI":"10.1109\/SPDP.1994.346119"},{"key":"10.1006\/jpdc.1998.1503_RF15","doi-asserted-by":"crossref","unstructured":"F. Dehne, A. Fabri, A. Rau-Chaplin, Scalable parallel geometric algorithms for coarse grained multicomputers, ACM Symposium on Computational Geometry, 1993","DOI":"10.1145\/160985.161154"},{"key":"10.1006\/jpdc.1998.1503_RF16","doi-asserted-by":"crossref","unstructured":"X. Deng, N. Gu, Good algorithm design style for multiprocessors, Proc. of the 6th IEEE Symposium on Parallel and Distributed Processing, October, Dallas, 1994","DOI":"10.1109\/SPDP.1994.346125"},{"key":"10.1006\/jpdc.1998.1503_RF17","doi-asserted-by":"crossref","first-page":"361","DOI":"10.1007\/BF02237955","article-title":"A note on linear expected time algorithms for finding convex hulls","volume":"26","author":"Devroye","year":"1981","journal-title":"Computing"},{"key":"10.1006\/jpdc.1998.1503_RF18","series-title":"EATCS Monographs on Theoretical Computer Science","article-title":"Algorithms in combinatorial geometry","author":"Edelsbrunner","year":"1987"},{"key":"10.1006\/jpdc.1998.1503_RF19","doi-asserted-by":"crossref","unstructured":"A. Ferreira, A. Rau-Chaplin, S. Ub\u00e9da, Scalable 2d convex hull and triangulation for coarse grained multicomputers, Proc. of the 6th IEEE Symposium on Parallel and Distributed Processing, San Antonio, 1995","DOI":"10.1109\/SPDP.1995.530733"},{"key":"10.1006\/jpdc.1998.1503_RF20","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1006\/jpdc.1994.1085","article-title":"Direct bulk-synchronous parallel algorithms","volume":"22","author":"Gerbessiotis","year":"1994","journal-title":"J. Parallel Distrib. Comput."},{"key":"10.1006\/jpdc.1998.1503_RF21","doi-asserted-by":"crossref","unstructured":"M. T. Goodrich, Communication-efficient parallel sorting, Proc. of the 28th annual ACM Symposium on Theory of Computing (STOC), May 22\u201324, Philadelphia, 1996","DOI":"10.1145\/237814.237870"},{"key":"10.1006\/jpdc.1998.1503_RF22","first-page":"714","article-title":"External-memory computational geometry","author":"Goodrich","year":"1993","journal-title":"IEEE Symposium on Foundations Comput. Sci."},{"key":"10.1006\/jpdc.1998.1503_RF23","unstructured":"Grand Challenges: High Performance Computing and Communications"},{"key":"10.1006\/jpdc.1998.1503_RF24","first-page":"345","article-title":"Randomized routing on fat-trees","volume":"5","author":"Greenberg","year":"1989","journal-title":"Adv. in Comput. Res."},{"key":"10.1006\/jpdc.1998.1503_RF25","doi-asserted-by":"crossref","unstructured":"H. Li, K. C. Sevick, Parallel sorting by overpartitioning, Proc. of the ACM Symposium on Parallel Algorithms and Architectures, 1994, 46, 56","DOI":"10.1145\/181014.192329"},{"key":"10.1006\/jpdc.1998.1503_RF26","series-title":"Introduction to Parallel Algorithms and Architectures: Arrays, Trees, Hypercubes","author":"Leighton","year":"1992"},{"key":"10.1006\/jpdc.1998.1503_RF27","unstructured":"P. D. MacKenzie, Q. S. Stout, Asymptotically efficient hypercube algorithms for computational geometrie, Proc. of the Third Symposium on the Frontiers of Massively Parallel Computation, 1980, 8, 11"},{"key":"10.1006\/jpdc.1998.1503_RF28","unstructured":"J. M. Marberg, E. Gafni, Sorting in constant number of row and column phases on a mesh, Proc. Allerton Conference on Communication, Control and Computing, 1986, 603, 612"},{"key":"10.1006\/jpdc.1998.1503_RF29","doi-asserted-by":"crossref","first-page":"399","DOI":"10.1007\/BF01414464","article-title":"An optimal parallel algorithm for triangulation of a set of points in the plane","volume":"15","author":"Merks","year":"1986","journal-title":"Int. J. Parallel Progr."},{"key":"10.1006\/jpdc.1998.1503_RF30","unstructured":"R. Miller, Q. F. Sout, Computational geometry on a mesh-connected computer (Preliminary version), Proc. of the 1984 International Conference on Parallel Processing, 1984, 236, 271"},{"key":"10.1006\/jpdc.1998.1503_RF31","doi-asserted-by":"crossref","first-page":"1605","DOI":"10.1109\/12.9737","article-title":"Efficent parallel convex hull algorithm","volume":"37","author":"Miller","year":"1988","journal-title":"IEEE Trans. Comput."},{"key":"10.1006\/jpdc.1998.1503_RF32","article-title":"Parallel algorithm for the convex hull problem in two dimensions","author":"Nath","year":"1980","journal-title":"Technical Report"},{"key":"10.1006\/jpdc.1998.1503_RF33","series-title":"Computational Geometry: an Introduction","author":"Preparata","year":"1985"},{"key":"10.1006\/jpdc.1998.1503_RF34","doi-asserted-by":"crossref","first-page":"60","DOI":"10.1145\/7531.7532","article-title":"A logarithmic time sort for linear size networks","volume":"34","author":"Reif","year":"1987","journal-title":"J. Assoc. Comput. Math."},{"key":"10.1006\/jpdc.1998.1503_RF35","first-page":"103","article-title":"A bridging model for parallel computation","volume":"38","author":"Valiant","year":"1990","journal-title":"Commun. Assoc. Comput. Mach."},{"key":"10.1006\/jpdc.1998.1503_RF36","series-title":"General Purpose Parallel Architecture","author":"Valiant","year":"1990"},{"key":"10.1006\/jpdc.1998.1503_RF37","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1016\/0020-0190(87)90093-7","article-title":"AnOn","volume":"25","author":"Wang","year":"1987","journal-title":"Inform. Process. Lett."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731598915039?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0743731598915039?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,12,17]],"date-time":"2019-12-17T14:27:34Z","timestamp":1576592854000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0743731598915039"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1999,1]]},"references-count":37,"journal-issue":{"issue":"1","published-print":{"date-parts":[[1999,1]]}},"alternative-id":["S0743731598915039"],"URL":"https:\/\/doi.org\/10.1006\/jpdc.1998.1503","relation":{},"ISSN":["0743-7315"],"issn-type":[{"value":"0743-7315","type":"print"}],"subject":[],"published":{"date-parts":[[1999,1]]}}}