{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T04:31:50Z","timestamp":1777437110185,"version":"3.51.4"},"reference-count":11,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1985,1,1]],"date-time":"1985-01-01T00:00:00Z","timestamp":473385600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computers & Graphics"],"published-print":{"date-parts":[[1985,1]]},"DOI":"10.1016\/0097-8493(85)90035-4","type":"journal-article","created":{"date-parts":[[2003,8,7]],"date-time":"2003-08-07T19:49:30Z","timestamp":1060285770000},"page":"407-413","source":"Crossref","is-referenced-by-count":11,"title":["Efficient algorithms for automatic viewer orientation"],"prefix":"10.1016","volume":"9","author":[{"given":"David P.","family":"Anderson","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/0097-8493(85)90035-4_BIB1","doi-asserted-by":"crossref","first-page":"35","DOI":"10.1016\/0097-8493(82)90014-0","article-title":"An orientation method for central projection programs","volume":"6","author":"Anderson","year":"1982","journal-title":"Comput. Graphics"},{"key":"10.1016\/0097-8493(85)90035-4_BIB2","first-page":"87","article-title":"Divide and conquer for linear expected time","volume":"7","author":"Bentley","year":"1978"},{"key":"10.1016\/0097-8493(85)90035-4_BIB3","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1145\/355921.355927","article-title":"Optimal expected time algorithms for closest point problems","volume":"16","author":"Bentley","year":"1980","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0097-8493(85)90035-4_BIB4","first-page":"41","article-title":"Minimum vertex distance between separable convex polygons","volume":"18","author":"Chin","year":"1984"},{"key":"10.1016\/0097-8493(85)90035-4_BIB5","doi-asserted-by":"crossref","first-page":"331","DOI":"10.1093\/biomet\/52.3-4.331","article-title":"The convex hull of a random set of points","volume":"52","author":"Efron","year":"1965","journal-title":"Biometrika"},{"key":"10.1016\/0097-8493(85)90035-4_BIB6","doi-asserted-by":"crossref","first-page":"379","DOI":"10.1287\/trsc.6.4.379","article-title":"Geometrical solutions for some minimax location problems","volume":"6","author":"Elzinga","year":"1972","journal-title":"Trans. Sci."},{"key":"10.1016\/0097-8493(85)90035-4_BIB7","first-page":"132","article-title":"An efficient algorithm for determining the convex hull of a finite planar set","volume":"1","author":"Graham","year":"1972"},{"key":"10.1016\/0097-8493(85)90035-4_BIB8","doi-asserted-by":"crossref","first-page":"415","DOI":"10.1137\/1007084","article-title":"The smallest covering cone or sphere","volume":"7","author":"Lawson","year":"1965","journal-title":"SIAM Rev."},{"key":"10.1016\/0097-8493(85)90035-4_BIB9","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1137\/0210006","article-title":"Generalizations of Voronoi diagrams in the plane","volume":"10","author":"Lee","year":"1981","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0097-8493(85)90035-4_BIB10","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","article-title":"Convex hull of finite sets of points in two and three dimensions","volume":"20","author":"Preparata","year":"1977","journal-title":"CACM"},{"key":"10.1016\/0097-8493(85)90035-4_BIB11","series-title":"16th Annual Symposium on Foundations of Computer Science","first-page":"151","article-title":"Closest-point problems","author":"Shamos","year":"1975"}],"container-title":["Computers & Graphics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097849385900354?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0097849385900354?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,15]],"date-time":"2019-03-15T02:27:43Z","timestamp":1552616863000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0097849385900354"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1985,1]]},"references-count":11,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1985,1]]}},"alternative-id":["0097849385900354"],"URL":"https:\/\/doi.org\/10.1016\/0097-8493(85)90035-4","relation":{},"ISSN":["0097-8493"],"issn-type":[{"value":"0097-8493","type":"print"}],"subject":[],"published":{"date-parts":[[1985,1]]}}}