{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:32:15Z","timestamp":1759638735698},"reference-count":19,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1989,10,1]],"date-time":"1989-10-01T00:00:00Z","timestamp":623203200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":8690,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1989,10]]},"DOI":"10.1016\/0022-0000(89)90042-1","type":"journal-article","created":{"date-parts":[[2003,12,4]],"date-time":"2003-12-04T12:01:00Z","timestamp":1070539260000},"page":"153-165","source":"Crossref","is-referenced-by-count":23,"title":["Parallel construction of subdivision hierarchies"],"prefix":"10.1016","volume":"39","author":[{"given":"N.","family":"Dadoun","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"D.G.","family":"Kirkpatrick","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0022-0000(89)90042-1_BIB1","series-title":"Proceedings, 26th IEEE Symposium on Foundations of Computer Science","first-page":"468","article-title":"Parallel computational geometry (extended abstract)","author":"Aggarwal","year":"1985"},{"key":"10.1016\/0022-0000(89)90042-1_BIB2","doi-asserted-by":"crossref","first-page":"535","DOI":"10.1007\/BF01762120","article-title":"Parallel computational geometry","volume":"3","author":"Aggarwal","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/0022-0000(89)90042-1_BIB3","series-title":"Proceedings, 2nd ACM Symposium on Computational Geometry","first-page":"216","article-title":"Efficient plane sweeping in parallel (preliminary version)","author":"Atallah","year":"1986"},{"key":"10.1016\/0022-0000(89)90042-1_BIB4","series-title":"Proceedings, 18th ACM Symposium on Theory of Computing","first-page":"206","article-title":"Deterministic coin tossing and accelerating cascades: Micro and macro techniques for designing parallel algorithms","author":"Cole","year":"1986"},{"key":"10.1016\/0022-0000(89)90042-1_BIB5","series-title":"Proceedings, 3rd ACM Symposium on Computational Geometry","first-page":"204","article-title":"Parallel processing for efficient subdivision search","author":"Dadoun","year":"1987"},{"key":"10.1016\/0022-0000(89)90042-1_BIB6","series-title":"Computer Science Dept. Technical Report, TR 87-15","article-title":"A Parallel Algorithm for Finding Maximal Independent Sets in Planar Graphs","author":"Dadoun","year":"1987"},{"key":"10.1016\/0022-0000(89)90042-1_BIB7","series-title":"Proceedings, International Colloquium on Automata, Languages and Programming","first-page":"154","article-title":"Fast detection of polyhedral intersections","author":"Dobkin","year":"1982"},{"key":"10.1016\/0022-0000(89)90042-1_BIB8","doi-asserted-by":"crossref","first-page":"241","DOI":"10.1016\/0304-3975(82)90120-7","article-title":"Fast detection of polyhedral intersection","volume":"27","author":"Dobkin","year":"1983","journal-title":"Theoret. Comput. Sci."},{"issue":"No. 3","key":"10.1016\/0022-0000(89)90042-1_BIB9","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0196-6774(85)90007-0","article-title":"A linear time algorithm for determining the separation of convex polyhedra","volume":"6","author":"Dobkin","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/0022-0000(89)90042-1_BIB10","unstructured":"D. P. Dobkin and D. G. Kirkpatrick, Fast algorithms for preprocessed polyhedral intersection detection, in preparation."},{"issue":"No. 2","key":"10.1016\/0022-0000(89)90042-1_BIB11","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1145\/357337.357338","article-title":"A new point-location algorithm and its practical efficiency\u2014comparison with existing algorithms","volume":"3","author":"Edahiro","year":"1984","journal-title":"ACM Trans. Graphics"},{"key":"10.1016\/0022-0000(89)90042-1_BIB12","series-title":"Proceedings, 16th ACM Symposium on Theory of Computing","first-page":"315","article-title":"Parallel symmetry-breaking in sparse graphs","author":"Goldberg","year":"1987"},{"key":"10.1016\/0022-0000(89)90042-1_BIB13","series-title":"Proceedings, International Colloquium on Automata, Languages and Programming","first-page":"304","article-title":"Parallel 5-colouring of planar graphs","author":"Hagerup","year":"1987"},{"key":"10.1016\/0022-0000(89)90042-1_BIB14","series-title":"Parallel algorithms for computing maximal independent sets in trees and for updating minimum spanning trees","author":"Jung","year":"1987"},{"issue":"No. 1","key":"10.1016\/0022-0000(89)90042-1_BIB15","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","article-title":"Optimal search in planar subdivisions","volume":"12","author":"Kirkpatrick","year":"1983","journal-title":"SIAM J. Comput."},{"issue":"No. 4","key":"10.1016\/0022-0000(89)90042-1_BIB16","doi-asserted-by":"crossref","first-page":"185","DOI":"10.1016\/0020-0190(78)90065-0","article-title":"A batching method for coloring planar graphs","volume":"7","author":"Lipton","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0022-0000(89)90042-1_BIB17","series-title":"The Analysis of Algorithms","author":"Purdom","year":"1985"},{"key":"10.1016\/0022-0000(89)90042-1_BIB18","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":"1978","journal-title":"Comm. ACM"},{"key":"10.1016\/0022-0000(89)90042-1_BIB19","article-title":"The Complexity of Parallel Computation","author":"Wylie","year":"1979"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900421?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0022000089900421?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,2,16]],"date-time":"2019-02-16T13:55:15Z","timestamp":1550325315000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0022000089900421"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989,10]]},"references-count":19,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1989,10]]}},"alternative-id":["0022000089900421"],"URL":"https:\/\/doi.org\/10.1016\/0022-0000(89)90042-1","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1989,10]]}}}