{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,12]],"date-time":"2026-05-12T20:34:28Z","timestamp":1778618068840,"version":"3.51.4"},"reference-count":20,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,10,1]],"date-time":"1994-10-01T00:00:00Z","timestamp":780969600000},"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":6864,"URL":"http:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"funder":[{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["04452191"],"award-info":[{"award-number":["04452191"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001700","name":"Ministry of Education, Culture, Sports, Science and Technology","doi-asserted-by":"publisher","award":["05555027"],"award-info":[{"award-number":["05555027"]}],"id":[{"id":"10.13039\/501100001700","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Journal of Computer and System Sciences"],"published-print":{"date-parts":[[1994,10]]},"DOI":"10.1016\/s0022-0000(05)80056-x","type":"journal-article","created":{"date-parts":[[2005,8,20]],"date-time":"2005-08-20T11:18:35Z","timestamp":1124536715000},"page":"391-407","source":"Crossref","is-referenced-by-count":27,"title":["Robust gift wrapping for the three-dimensional convex hull"],"prefix":"10.1016","volume":"49","author":[{"given":"Kokichi","family":"Sugihara","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0022-0000(05)80056-X_bib1","series-title":"International Workshop on Computational Geometry, Wurzburg, March 1988","first-page":"113","article-title":"A divide-and-conquer algorithm for computing 4-dimensional convex hull","volume":"Vol. 333","author":"Buckley","year":"1988"},{"key":"10.1016\/S0022-0000(05)80056-X_bib2","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/321556.321564","article-title":"An algorithm for convex polytopes","volume":"17","author":"Chand","year":"1970","journal-title":"J. Assoc. Comput. Mach."},{"key":"10.1016\/S0022-0000(05)80056-X_bib3","article-title":"An Optimal Convex Hull Algorithm for Point Sets in Any Dimension","author":"Chazelle","year":"1991"},{"key":"10.1016\/S0022-0000(05)80056-X_bib4","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1145\/355759.355766","article-title":"A new convex hull algorithm for planar sets","volume":"3","author":"Eddy","year":"1977","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/S0022-0000(05)80056-X_bib5","series-title":"Proceedings, 30th Annual Symposium on Foundations of Computer Science","first-page":"494","article-title":"Stable maintenance of point-set triangulations in two dimensions","author":"Fortune","year":"1989"},{"key":"10.1016\/S0022-0000(05)80056-X_bib6","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","article-title":"An efficient algorithm for determining the convex hull of a finite planar set","volume":"1","author":"Graham","year":"1972","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(05)80056-X_bib7","series-title":"Proceedings, 5th Annual Symposium on Computational Geometry","first-page":"208","article-title":"Epsilon geometry\u2014Building robust algorithms from imprecise calculations","author":"Guibas","year":"1989"},{"key":"10.1016\/S0022-0000(05)80056-X_bib8","article-title":"A Paradigm for Robust Geometric Algorithms","author":"Hopcroft","year":"1989"},{"key":"10.1016\/S0022-0000(05)80056-X_bib9","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0020-0190(73)90020-3","article-title":"On the identification of the convex hull of a finite set of points in the plane","volume":"2","author":"Jarvis","year":"1973","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/S0022-0000(05)80056-X_bib10","series-title":"Convex Figures and Polyhedra","author":"Lyusternik","year":"1963"},{"key":"10.1016\/S0022-0000(05)80056-X_bib11","series-title":"Geometric Reasoning","first-page":"377","article-title":"Verifiable implementations of geometric algorithms using finite precision arithmetic","author":"Milenkovic","year":"1989"},{"key":"10.1016\/S0022-0000(05)80056-X_bib12","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0166-218X(91)90071-4","article-title":"Problems, problems, problems","volume":"31","author":"Moser","year":"1991","journal-title":"Discrete App. Math."},{"key":"10.1016\/S0022-0000(05)80056-X_bib13","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":"2","author":"Preparata","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/S0022-0000(05)80056-X_bib14","series-title":"Computational Geometry\u2014An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0022-0000(05)80056-X_bib15","series-title":"Proceedings, 18th Annual ACM Symposium on Theory of Computing","first-page":"404","article-title":"Constructing higher-dimensional convex hulls at logarithmic cost per face","author":"Seidel","year":"1986"},{"key":"10.1016\/S0022-0000(05)80056-X_bib16","first-page":"1","article-title":"Polyeder und Raumeinteilungen","volume":"Band III","author":"Steinitz","year":"1916","journal-title":"Encyklop\u00e4die der mathematischen Wissenschaften"},{"key":"10.1016\/S0022-0000(05)80056-X_bib17","series-title":"Third International Symposium on Algorithms and Computation, Nagoya, 1992","first-page":"209","article-title":"Topologically consistent algorithms related to convex polyhedra","volume":"Vol. 650","author":"Sugihara","year":"1992"},{"key":"10.1016\/S0022-0000(05)80056-X_bib18","doi-asserted-by":"crossref","first-page":"203","DOI":"10.1016\/0893-9659(89)90022-0","article-title":"Two design principles of geometric algorithms in finite-precision arithmetic","volume":"2","author":"Sugihara","year":"1989","journal-title":"Appl. Math. Lett."},{"key":"10.1016\/S0022-0000(05)80056-X_bib19","first-page":"1471","article-title":"Construction of the Voronoi diagram for \u201cone million\u201d generators in single-precision arithmetic","volume":"80","author":"Sugihara","year":"1992"},{"key":"10.1016\/S0022-0000(05)80056-X_bib20","doi-asserted-by":"crossref","first-page":"17","DOI":"10.1016\/0196-6774(85)90017-3","article-title":"Finding the convex hull facet by facet","volume":"6","author":"Swart","year":"1985","journal-title":"J. Algorithms"}],"container-title":["Journal of Computer and System Sciences"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000580056X?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S002200000580056X?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2022,6,23]],"date-time":"2022-06-23T14:41:06Z","timestamp":1655995266000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S002200000580056X"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,10]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,10]]}},"alternative-id":["S002200000580056X"],"URL":"https:\/\/doi.org\/10.1016\/s0022-0000(05)80056-x","relation":{},"ISSN":["0022-0000"],"issn-type":[{"value":"0022-0000","type":"print"}],"subject":[],"published":{"date-parts":[[1994,10]]}}}