{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T22:25:55Z","timestamp":1757543155611,"version":"3.32.0"},"reference-count":12,"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\/bf01414464","type":"journal-article","created":{"date-parts":[[2005,4,3]],"date-time":"2005-04-03T08:36:23Z","timestamp":1112517383000},"page":"399-411","source":"Crossref","is-referenced-by-count":10,"title":["An optimal parallel algorithm for triangulating a set of points in the plane"],"prefix":"10.1007","volume":"15","author":[{"given":"Ed","family":"Merks","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"CR1","unstructured":"C. L. Lawson, C1-compatible Interpolation Over a Triangle,Jet Propulsion Lab., Technical Memo. pp. 33?770 (May 1976)."},{"key":"CR2","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,Intl. J. Numer. Methods Eng.,8:679?696 (1974).","journal-title":"Intl. J. Numer. Methods Eng."},{"key":"CR3","doi-asserted-by":"crossref","unstructured":"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).","DOI":"10.1109\/SFCS.1985.65"},{"key":"CR4","unstructured":"M. I. Shamos, Computational Geometry, Ph.D. Dissertation, Yale University (May 1978)."},{"key":"CR5","doi-asserted-by":"crossref","unstructured":"H. ElGindy, An Optimal Parallel Algorithm for Triangulating Simplicial Points Sets in Space,Internal Report, University of Pennsylvania (April 1986).","DOI":"10.1007\/BF01414463"},{"key":"CR6","unstructured":"M. Goodrich, and M. Atallah, Efficient Plane Sweeping in Parallel,Proc. of the Second Symp. on Computational Geometry, York Heights (June 1985)."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"S. Fortune and J. Wyllie, Parallelism in Random Access Machines,Proc. 10th STOC, 114?118 (1978).","DOI":"10.1145\/800133.804339"},{"key":"CR8","doi-asserted-by":"crossref","unstructured":"M. Snir, On Parallel Searching,Proc. ACM Symp. on Distributed Computing, pp. 242?253 (1982).","DOI":"10.1145\/800220.806703"},{"key":"CR9","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/BF02579338","volume":"3","author":"M. Ajtai","year":"1983","unstructured":"M. Ajtai, J. Komlos, and E. Szemerdi, Sorting in clogn Parallel Steps,Combinitorica,3:1?19 (1983).","journal-title":"Combinitorica"},{"key":"CR10","unstructured":"M. Atallah and M. Goodrich, Efficient Parallel Solutions to Geometric Problems, to appear in:J. of Parallel Dist. Comp., A preliminary version appeared in:Proc. 1985 Intl. Conf. on Parallel Proc., pp. 411?417."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"965","DOI":"10.1109\/TC.1985.6312202","volume":"34","author":"C. Kruskal","year":"1985","unstructured":"C. Kruskal, L. Rudolph, and M. Snir, The Power of Parallel Prefix,IEEE Trans. Comput.,C-34:965?968 (October 1985).","journal-title":"IEEE Trans. Comput., C"},{"issue":"7","key":"CR12","doi-asserted-by":"crossref","first-page":"571","DOI":"10.1109\/TC.1980.1675628","volume":"29","author":"J. L. Bentley","year":"1980","unstructured":"J. L. Bentley and D. Wood, An Optimal Worst Case Algorithm for Reporting Intersections of Rectangles,IEEE Transactions of Computers,C-29(7):571?576 (July 1980).","journal-title":"IEEE Transactions of Computers, C"}],"container-title":["International Journal of Parallel Programming"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01414464.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF01414464\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF01414464","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,12,30]],"date-time":"2024-12-30T16:09:42Z","timestamp":1735574982000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF01414464"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1986,10]]},"references-count":12,"journal-issue":{"issue":"5","published-print":{"date-parts":[[1986,10]]}},"alternative-id":["BF01414464"],"URL":"https:\/\/doi.org\/10.1007\/bf01414464","relation":{},"ISSN":["0885-7458","1573-7640"],"issn-type":[{"type":"print","value":"0885-7458"},{"type":"electronic","value":"1573-7640"}],"subject":[],"published":{"date-parts":[[1986,10]]}}}