{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,10]],"date-time":"2025-09-10T21:47:05Z","timestamp":1757540825373},"reference-count":5,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1983,6,1]],"date-time":"1983-06-01T00:00:00Z","timestamp":423273600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["BIT"],"published-print":{"date-parts":[[1983,6]]},"DOI":"10.1007\/bf02218436","type":"journal-article","created":{"date-parts":[[2005,10,6]],"date-time":"2005-10-06T08:33:43Z","timestamp":1128587623000},"page":"145-160","source":"Crossref","is-referenced-by-count":7,"title":["A simple algorithm for building the 3-D convex hull"],"prefix":"10.1007","volume":"23","author":[{"given":"Gunner Helweg","family":"Johansen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Chr","family":"Gram","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"BF02218436_CR1","volume-title":"A Discipline of Programming","author":"E. W. Dijkstra","year":"1976","unstructured":"E. W. Dijkstra,A Discipline of Programming, Prentice-Hall, Inc., Englewood Cliffs, N.J., (1976)."},{"key":"BF02218436_CR2","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0020-0190(73)90020-3","volume":"2","author":"R. A. Jarvis","year":"1973","unstructured":"R. A. Jarvis,On the identification of the convex hull of a finite set of points in the plane, Inform. Proc. Letters 2 (1973), 18\u201321.","journal-title":"Inform. Proc. Letters"},{"issue":"2","key":"BF02218436_CR3","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","volume":"20","author":"F. P. Preparata","year":"1977","unstructured":"F. P. Preparata and S. J. Hong,Convex hulls of finite sets of points in two and three dimensions, CACM 20, 2 (Febr. 1977), 87\u201393.","journal-title":"CACM"},{"key":"BF02218436_CR4","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(78)90051-0","volume":"7","author":"J. L. Bentley","year":"1978","unstructured":"J. L. Bentley and M. I. Shamos,Divide and conquer for linear expected time, Inform. Proc. Letters 7 (1978), 87\u201391.","journal-title":"Inform. Proc. Letters"},{"key":"BF02218436_CR5","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1145\/321556.321564","volume":"17","author":"D. R. Chand","year":"1970","unstructured":"D. R. Chand and Sham S. Kapur,An algorithm for convex polytopes, Journ. ACM 17 (1970), 78\u201386.","journal-title":"Journ. ACM"}],"container-title":["BIT"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02218436.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF02218436\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF02218436","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,14]],"date-time":"2019-05-14T22:04:11Z","timestamp":1557871451000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF02218436"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,6]]},"references-count":5,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,6]]}},"alternative-id":["BF02218436"],"URL":"https:\/\/doi.org\/10.1007\/bf02218436","relation":{},"ISSN":["0006-3835","1572-9125"],"issn-type":[{"value":"0006-3835","type":"print"},{"value":"1572-9125","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,6]]}}}