{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:49:51Z","timestamp":1757540991101,"version":"3.32.0"},"reference-count":13,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[1986,10,1]],"date-time":"1986-10-01T00:00:00Z","timestamp":528508800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Int J Parallel Prog"],"published-print":{"date-parts":[[1986,10]]},"DOI":"10.1007\/bf01414463","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T08:36:23Z","timestamp":1112517383000},"page":"389-398","source":"Crossref","is-referenced-by-count":9,"title":["An optimal speed-up parallel algorithm for triangulating simplicial point sets in space"],"prefix":"10.1007","volume":"15","author":[{"given":"Hossam","family":"ElGindy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"doi-asserted-by":"crossref","unstructured":"A. Aggarwal, B. Chazelle, L. Guibas, C. O'Dunlaing, and C. Yap, Parallel Computational Geometry: extended abstract,Proc. of 26th Annual Symp. on Found of Computer Sci., Portland, pp. 468?477 (October 1985).","key":"CR1","DOI":"10.1109\/SFCS.1985.42"},{"unstructured":"A. Chow,Parallel Algorithms for Geometric Problems, Ph.D. dissertation, Computer Science Department, University of Illinois at Urbana-Champaign (1980).","key":"CR2"},{"doi-asserted-by":"crossref","unstructured":"M. J. Atallah and M. T. Goodrich, Efficient plane sweeping in parallel,Proc. of the Second Symp. on Computational Geometry, York Heights (June 1986).","key":"CR3","DOI":"10.1145\/10515.10539"},{"unstructured":"E. Merks, Triangulating a set of points in the plane, manuscript, Department of Computing Science, Simon Fraser University (April 1986).","key":"CR4"},{"doi-asserted-by":"crossref","unstructured":"D. Avis and H. Elgindy, Triangulating simplicial point sets in space: extended abstract,Proc. of the Second Symp. on Computational Geometry, York Heights (June 1986).","key":"CR5","DOI":"10.1145\/10515.10530"},{"unstructured":"C. L. Lawson,C 1-compatible interpolation over a triangle, Jet Propulsion Lab., Technical Memo., pp. 33?770 (May 1976).","key":"CR6"},{"key":"CR7","doi-asserted-by":"crossref","first-page":"679","DOI":"10.1002\/nme.1620080402","volume":"8","author":"J. C. Cavendish","year":"1974","unstructured":"J. C. Cavendish, Automatic triangulation of arbitrary planar domains for the finite element method,Int. J. Numer. Methods Eng.,8:679?696 (1974).","journal-title":"Int. J. Numer. Methods Eng."},{"doi-asserted-by":"crossref","unstructured":"T. Asano, T. Asano, L. Guibas, J. Hershberger, and H. Imai, Visibility polygon search and euclidean shortest paths,Proc. of 26th Annual Symp. on Found. of Computer Sci., Portland, pp. 155?164 (October 1985).","key":"CR8","DOI":"10.1109\/SFCS.1985.65"},{"doi-asserted-by":"crossref","unstructured":"M. I. Shamos and D. Hoey, closest point problems,Proc. of 16th Annual Symp. on Found. of Computer Sci., pp. 151?162 (October 1985).","key":"CR9","DOI":"10.1109\/SFCS.1975.8"},{"issue":"4","key":"CR10","doi-asserted-by":"crossref","first-page":"344","DOI":"10.1109\/TC.1985.5009385","volume":"34","author":"T. Leighton","year":"1985","unstructured":"T. Leighton, Tight bounds on the complexity of parallel sorting,IEEE Transactions on Computers,C-34(4):344?354 (1985).","journal-title":"IEEE Transactions on Computers, C"},{"key":"CR11","doi-asserted-by":"crossref","first-page":"88","DOI":"10.1016\/0196-6774(81)90010-9","volume":"2","author":"Y. Shiloach","year":"1981","unstructured":"Y. Shiloach and U. Vishkin, Finding the maximum, merging, and sorting in a parallel computation model,?J. of Algorithms,2:88?102 (1981).","journal-title":"J. of Algorithms"},{"key":"CR12","volume-title":"Yhe Design and Analysis of Computer Algorithms","author":"A. V. Aho","year":"1974","unstructured":"A. V. Aho, J. E. Hopcroft, and J. D. Ullman,Yhe Design and Analysis of Computer Algorithms, Readings, Addison-Wesley Publishing Company (1974)."},{"key":"CR13","doi-asserted-by":"crossref","first-page":"831","DOI":"10.1145\/322217.322232","volume":"27","author":"R. E. Ladner","year":"1980","unstructured":"R. E. Ladner and M. J. Fischer, Parallel prefix computation,J. of ACM,27:831?838 (October 1980).","journal-title":"J. of ACM"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01414463.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01414463\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01414463","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T16:09:40Z","timestamp":1735574980000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01414463"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,10]]},"references-count":13,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1986,10]]}},"alternative-id":["BF01414463"],"URL":"https:\/\/doi.org\/10.1007\/bf01414463","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[1986,10]]}}}