{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T18:09:21Z","timestamp":1758823761944},"reference-count":16,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1983,4,1]],"date-time":"1983-04-01T00:00:00Z","timestamp":418003200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["International Journal of Computer and Information Sciences"],"published-print":{"date-parts":[[1983,4]]},"DOI":"10.1007\/bf00993195","type":"journal-article","created":{"date-parts":[[2005,1,9]],"date-time":"2005-01-09T16:52:31Z","timestamp":1105289551000},"page":"87-98","source":"Crossref","is-referenced-by-count":48,"title":["On finding the convex hull of a simple polygon"],"prefix":"10.1007","volume":"12","author":[{"given":"D. T.","family":"Lee","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"CR1","doi-asserted-by":"crossref","first-page":"219","DOI":"10.1016\/0020-0190(78)90003-0","volume":"7","author":"S. G. Akl","year":"1978","unstructured":"S. G. Akl and G. T. Toussaint, ?A fast convex hull algorithm,?Info. Proc. Lett.,7:219?222 (1978).","journal-title":"Info. Proc. Lett."},{"key":"CR2","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0020-0190(79)90072-3","volume":"9","author":"A. M. Andrew","year":"1979","unstructured":"A. M. Andrew, ?Another efficient algorithm for convex hull in 2-dimensions,?Info. Proc. Lett.,9:216?219 (1979).","journal-title":"Info. Proc. Lett."},{"key":"CR3","unstructured":"D. Avis, ?On the complexity of finding the convex hull of a set of points,? Tech. Rep., SOCS 79.2, School of Computer Science, McGill University, (1979)."},{"key":"CR4","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0020-0190(78)90021-2","volume":"7","author":"A. Bykat","year":"1978","unstructured":"A. Bykat, ?Convex hull of a finite set of points in two dimensions,?Info. Proc. Lett.,7:296?298 (1978).","journal-title":"Info. Proc. Lett."},{"key":"CR5","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1145\/355759.355766","volume":"3","author":"W. E. Eddy","year":"1977","unstructured":"W. E. Eddy, ?A new convew hull algorithm for planar sets,?A CM Trans. Math. Software,3:398?403 (1977).","journal-title":"A CM Trans. Math. Software"},{"key":"CR6","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","volume":"1","author":"R. L. Graham","year":"1972","unstructured":"R. L. Graham, ?An efficient algorithm for determining the convex hull of a finite planar set,?Info. Proc. Lett. 1:132?133 (1972).","journal-title":"Info. Proc. Lett."},{"key":"CR7","doi-asserted-by":"crossref","unstructured":"R. L. Graham and F. F. Yao, ?Finding the convex hull of a simple polygon,?J. Algorithms (to appear).","DOI":"10.1016\/0196-6774(83)90013-5"},{"key":"CR8","doi-asserted-by":"crossref","first-page":"189","DOI":"10.1016\/0020-0190(78)90066-2","volume":"7","author":"D. T. Lee","year":"1978","unstructured":"D. T. Lee and F. P. Preparata, ?The all nearest neighbor problem for convex polygons,?Info. Proc. Lett.,7:189?192 (1978).","journal-title":"Info. Proc. Lett."},{"key":"CR9","doi-asserted-by":"crossref","first-page":"201","DOI":"10.1016\/0020-0190(79)90069-3","volume":"9","author":"D. McCallum","year":"1979","unstructured":"D. McCallum and D. Avis, ?A linear time algorithm for finding the convex hull of a simple polygon,?Info. Proc. Leu.,9:201?205 (1979).","journal-title":"Info. Proc. Leu."},{"key":"CR10","unstructured":"J. O'Rourke and G. T. Toussaint, private communication."},{"key":"CR11","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1145\/359131.359132","volume":"22","author":"F. P. Preparata","year":"1979","unstructured":"F. P. Preparata, ?An optimal real time algorithm for planar convex hulls,?Comm. ACM. 22:402?405 (1979).","journal-title":"Comm. ACM."},{"key":"CR12","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,?Comm. ACM,20:87?93 (1977).","journal-title":"Comm. ACM"},{"key":"CR13","unstructured":"M. I. Shamos, ?Problems in computational geometry,? Department of Computer Science, Yale University (1975 and 1977)."},{"key":"CR14","doi-asserted-by":"crossref","first-page":"1355","DOI":"10.1109\/T-C.1972.223507","volume":"C-21","author":"J. Sklansky","year":"1972","unstructured":"J. Sklansky, ?Measuring concavity on a rectangular mosaic,?IEEE Trans. Comput.,C-21:1355?1364 (1972).","journal-title":"IEEE Trans. Comput."},{"key":"CR15","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1016\/0167-8655(82)90016-2","volume":"1","author":"J. Sklansky","year":"1982","unstructured":"J. Sklansky, ?Finding the convex hull of a simple polygon,?Pattern Recognition Lett.,1:79?83 (1982).","journal-title":"Pattern Recognition Lett."},{"key":"CR16","doi-asserted-by":"crossref","unstructured":"G. T. Toussaint and H. El Gindy, ?An counterexample to an algorithm for computing monotone hulls of simple polygons,? Tech. Rep. SOCS 83.1, School of Computer Science, McGill University (1983).","DOI":"10.1016\/0167-8655(83)90028-4"}],"container-title":["International Journal of Computer & Information Sciences"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00993195.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/BF00993195\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/BF00993195","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,4,5]],"date-time":"2020-04-05T08:12:04Z","timestamp":1586074324000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/BF00993195"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1983,4]]},"references-count":16,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1983,4]]}},"alternative-id":["BF00993195"],"URL":"https:\/\/doi.org\/10.1007\/bf00993195","relation":{},"ISSN":["0091-7036","1573-7640"],"issn-type":[{"value":"0091-7036","type":"print"},{"value":"1573-7640","type":"electronic"}],"subject":[],"published":{"date-parts":[[1983,4]]}}}