{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,11]],"date-time":"2025-09-11T22:23:33Z","timestamp":1757629413747,"version":"3.44.0"},"reference-count":9,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[1990,3,1]],"date-time":"1990-03-01T00:00:00Z","timestamp":636249600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Journal of Parallel and Distributed Computing"],"published-print":{"date-parts":[[1990,3]]},"DOI":"10.1016\/0743-7315(90)90103-v","type":"journal-article","created":{"date-parts":[[2004,2,23]],"date-time":"2004-02-23T15:14:09Z","timestamp":1077549249000},"page":"280-285","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":7,"title":["An optimal parallel algorithm for building a data structure for planar point location"],"prefix":"10.1016","volume":"8","author":[{"given":"Richard","family":"Cole","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ofer","family":"Zajlcek","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0743-7315(90)90103-V_BIB1","series-title":"Proc. 25th IEEE Annual Symposium on Foundations of Computer Science","first-page":"468","article-title":"Parallel computational geometry","author":"Aggarwal","year":"1985"},{"key":"10.1016\/0743-7315(90)90103-V_BIB2","series-title":"Proc. 28th IEEE Annual Symposium on Foundations of Computer Science","first-page":"151","article-title":"Cascading divide-andconquer: A technique for designing parallel algorithms","author":"Atallah","year":"1988"},{"key":"10.1016\/0743-7315(90)90103-V_BIB3","series-title":"Proc. 2nd ACM Symposium on Computational Geometry","first-page":"216","article-title":"Efficient plane sweeping in parallel","author":"Atallah","year":"1986"},{"issue":"1","key":"10.1016\/0743-7315(90)90103-V_BIB4","doi-asserted-by":"crossref","first-page":"128","DOI":"10.1137\/0217009","article-title":"Approximate parallel scheduling. I. The basic technique with applications to optimal parallel list ranking in logarithmic time","volume":"17","author":"Cole","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0743-7315(90)90103-V_BIB5","unstructured":"Cole, R., and Vishkin, U. Approximate parallel scheduling. II. Application to optimal parallel graph algorithms in logarithmic time. Information and Computation, to appear."},{"key":"10.1016\/0743-7315(90)90103-V_BIB6","series-title":"Proc. 3rd ACM Symposium on Computational Geometry","first-page":"205","article-title":"Parallel processing for efficient subdivision search","author":"Dadoun","year":"1987"},{"key":"10.1016\/0743-7315(90)90103-V_BIB7","series-title":"19th Annual Symposium on Theory of Computing","first-page":"315","article-title":"Parallel symmetry-breaking in sparse graphs","author":"Goldberg","year":"1987"},{"key":"10.1016\/0743-7315(90)90103-V_BIB8","first-page":"304","article-title":"Parallel 5-colouring of planar graphs","author":"Hagerup","year":"1987","journal-title":"ICALP"},{"issue":"4","key":"10.1016\/0743-7315(90)90103-V_BIB9","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","article-title":"Optimal search in planar subdivision","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."}],"container-title":["Journal of Parallel and Distributed Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159090103V?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:074373159090103V?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T14:30:41Z","timestamp":1757514641000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/074373159090103V"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1990,3]]},"references-count":9,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1990,3]]}},"alternative-id":["074373159090103V"],"URL":"https:\/\/doi.org\/10.1016\/0743-7315(90)90103-v","relation":{},"ISSN":["0743-7315"],"issn-type":[{"type":"print","value":"0743-7315"}],"subject":[],"published":{"date-parts":[[1990,3]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"An optimal parallel algorithm for building a data structure for planar point location","name":"articletitle","label":"Article Title"},{"value":"Journal of Parallel and Distributed Computing","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/0743-7315(90)90103-V","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 1990 Published by Elsevier Inc.","name":"copyright","label":"Copyright"}]}}