{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T01:10:31Z","timestamp":1759626631398,"version":"build-2065373602"},"reference-count":13,"publisher":"Elsevier BV","issue":"1","license":[{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2002,10,1]],"date-time":"2002-10-01T00:00:00Z","timestamp":1033430400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":3942,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[2002,10]]},"DOI":"10.1016\/s0304-3975(01)00274-2","type":"journal-article","created":{"date-parts":[[2002,10,7]],"date-time":"2002-10-07T16:25:18Z","timestamp":1034007918000},"page":"277-295","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":2,"title":["Robust algorithms for constructing strongly convex hulls in parallel"],"prefix":"10.1016","volume":"289","author":[{"given":"Wei","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Koichi","family":"Wada","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kimio","family":"Kawaguchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0304-3975(01)00274-2_BIB1","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1007\/BF01762120","article-title":"Parallel computational geometry","volume":"3","author":"Aggarwal","year":"1988","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(01)00274-2_BIB2","doi-asserted-by":"crossref","unstructured":"D. Dobkin, D. Silver, Recipes for geometry and numerical analysis\u2014Part I: An empirical study, in: Proc. of the 4th Annual ACM Symposium on Computational Geometry, 1988, 93\u2013105.","DOI":"10.1145\/73393.73404"},{"key":"10.1016\/S0304-3975(01)00274-2_BIB3","doi-asserted-by":"crossref","unstructured":"S. Fortune, Stable maintenance of point set triangulations in two dimensions, in: Proc. of the 30th Annual Symposium on Foundations of Computer Science, 1989, 494\u2013499.","DOI":"10.1109\/SFCS.1989.63524"},{"year":"1988","series-title":"Efficient parallel algorithms.","author":"Gibbons","key":"10.1016\/S0304-3975(01)00274-2_BIB4"},{"key":"10.1016\/S0304-3975(01)00274-2_BIB5","doi-asserted-by":"crossref","unstructured":"D.H. Greene, F.F. Yao, Finite-resolution computational geometry, in: Proc. of the 27th IEEE Symposium on Foundations of Computer Science, 1986, 143\u2013152.","DOI":"10.1109\/SFCS.1986.19"},{"key":"10.1016\/S0304-3975(01)00274-2_BIB6","doi-asserted-by":"crossref","unstructured":"L. Guibas, D. Salesin, J. Stolfi, Epsilon geometry: building algorithms from imprecise computations, in: Proc. of the 5th Annual ACM Symposium on Computational Geometry, 1989, 208\u2013217.","DOI":"10.1145\/73833.73857"},{"key":"10.1016\/S0304-3975(01)00274-2_BIB7","doi-asserted-by":"crossref","first-page":"534","DOI":"10.1007\/BF01190154","article-title":"Constructing strongly convex approximate hulls with inaccurate primitives","volume":"9","author":"Guibas","year":"1993","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(01)00274-2_BIB8","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1109\/2.16223","article-title":"The problem of accuracy and robustness in geometric computation","volume":"22","author":"Hoffman","year":"1999","journal-title":"Computer"},{"key":"10.1016\/S0304-3975(01)00274-2_BIB9","doi-asserted-by":"crossref","first-page":"345","DOI":"10.1007\/BF01758851","article-title":"Constructing strongly convex hulls using exact or rounded arithmetic","volume":"8","author":"Li","year":"1992","journal-title":"Algorithmica"},{"key":"10.1016\/S0304-3975(01)00274-2_BIB10","doi-asserted-by":"crossref","first-page":"377","DOI":"10.1016\/0004-3702(88)90061-6","article-title":"Verifiable implementations of geometric algorithms using finite precision arithmetic","volume":"37","author":"Milenkovic","year":"1988","journal-title":"Artif. Intell."},{"key":"10.1016\/S0304-3975(01)00274-2_BIB11","doi-asserted-by":"crossref","unstructured":"V.J. Milenkovic, Calculating approximate curve arrangements using rounded arithmetic, in: Proc. the 5th Annual ACM Symposium on Computational Geometry, 1989, 197\u2013207.","DOI":"10.1145\/73833.73856"},{"key":"10.1016\/S0304-3975(01)00274-2_BIB12","doi-asserted-by":"crossref","unstructured":"V.J. Milenkovic, Double precision geometry: a general technique for calculating line and segment intersections using rounded arithmetic, in: Proc. of the 30th Annual Symposium on Foundations of Computer Science, 1989, 500\u2013505.","DOI":"10.1109\/SFCS.1989.63525"},{"key":"10.1016\/S0304-3975(01)00274-2_BIB13","doi-asserted-by":"crossref","unstructured":"T. Ottmann, F. Thiemt, C. Ullrich, Numerical stability of geometric algorithms. in: Proc. the 3th Annual ACM Symposium on Computational Geometry, 1987, 119\u2013125.","DOI":"10.1145\/41958.41970"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002742?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0304397501002742?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T00:52:24Z","timestamp":1759625544000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0304397501002742"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,10]]},"references-count":13,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2002,10]]}},"alternative-id":["S0304397501002742"],"URL":"https:\/\/doi.org\/10.1016\/s0304-3975(01)00274-2","relation":{},"ISSN":["0304-3975"],"issn-type":[{"type":"print","value":"0304-3975"}],"subject":[],"published":{"date-parts":[[2002,10]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"Robust algorithms for constructing strongly convex hulls in parallel","name":"articletitle","label":"Article Title"},{"value":"Theoretical Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/S0304-3975(01)00274-2","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"converted-article","name":"content_type","label":"Content Type"},{"value":"Copyright \u00a9 2002 Elsevier Science B.V. All rights reserved.","name":"copyright","label":"Copyright"}]}}