{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,10]],"date-time":"2026-02-10T17:20:15Z","timestamp":1770744015230,"version":"3.49.0"},"reference-count":12,"publisher":"Elsevier BV","issue":"3","license":[{"start":{"date-parts":[[1997,2,1]],"date-time":"1997-02-01T00:00:00Z","timestamp":854755200000},"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":6010,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Computational Geometry"],"published-print":{"date-parts":[[1997,2]]},"DOI":"10.1016\/0925-7721(95)00035-6","type":"journal-article","created":{"date-parts":[[2003,4,7]],"date-time":"2003-04-07T17:19:33Z","timestamp":1049735973000},"page":"187-200","source":"Crossref","is-referenced-by-count":9,"title":["Sequential and parallel algorithms for finding a maximum convex polygon"],"prefix":"10.1016","volume":"7","author":[{"given":"Paul","family":"Fischer","sequence":"first","affiliation":[]}],"member":"78","reference":[{"key":"10.1016\/0925-7721(95)00035-6_BIB1","series-title":"Proc. 3rd Symp. Comput. Geom.","first-page":"278","article-title":"Fast algorithms for computing the largest empty rectangle","author":"Aggarwal","year":"1987"},{"key":"10.1016\/0925-7721(95)00035-6_BIB2","doi-asserted-by":"crossref","first-page":"300","DOI":"10.1137\/0215022","article-title":"Computing the largest empty rectangle","volume":"15","author":"Chazelle","year":"1986","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(95)00035-6_BIB3","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1137\/0217026","article-title":"A functional approach to data structures and its use in multidimensional searching","volume":"17","author":"Chazelle","year":"1988","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0925-7721(95)00035-6_BIB4","first-page":"453","article-title":"Finding largest convex subsets","volume":"29","author":"Chv\u00e1tal","year":"1980","journal-title":"Congressus Numerantium"},{"key":"10.1016\/0925-7721(95)00035-6_BIB5","doi-asserted-by":"crossref","first-page":"45","DOI":"10.1007\/BF02187823","article-title":"Finding minimum area k-gons","volume":"7","author":"Eppstein","year":"1992","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/0925-7721(95)00035-6_BIB6","doi-asserted-by":"crossref","first-page":"218","DOI":"10.1016\/0890-5401(88)90049-1","article-title":"Minimal polygonal separation","volume":"77","author":"Edelsbrunner","year":"1988","journal-title":"Inform. and Comput."},{"key":"10.1016\/0925-7721(95)00035-6_BIB7","series-title":"Proc. Fund. Comput. Theory (FCT'93)","first-page":"234","article-title":"Finding maximum convex polygons","volume":"710","author":"Fischer","year":"1993"},{"key":"10.1016\/0925-7721(95)00035-6_BIB8","series-title":"Computational Learning Theory: Euro-Colt'93","first-page":"61","article-title":"Learning unions of convex polygons","author":"Fischer","year":"1994"},{"key":"10.1016\/0925-7721(95)00035-6_BIB9","series-title":"Proc. 8th Conf. Comput. Learning Theory","first-page":"337","article-title":"More or less efficient agnostic learning of convex polygons","author":"Fischer","year":"1995"},{"key":"10.1016\/0925-7721(95)00035-6_BIB10","series-title":"Minimizing disagreements for geometric concepts using dynamic programming","author":"Fischer","year":"1995"},{"key":"10.1016\/0925-7721(95)00035-6_BIB11","series-title":"An Introduction to Parallel Algorithms","author":"J\u00e1J\u00e1","year":"1992"},{"key":"10.1016\/0925-7721(95)00035-6_BIB12","series-title":"Computational Geometry, An Introduction","author":"Preparata","year":"1985"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000356?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0925772195000356?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,23]],"date-time":"2019-04-23T03:27:13Z","timestamp":1555990033000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0925772195000356"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,2]]},"references-count":12,"journal-issue":{"issue":"3","published-print":{"date-parts":[[1997,2]]}},"alternative-id":["0925772195000356"],"URL":"https:\/\/doi.org\/10.1016\/0925-7721(95)00035-6","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1997,2]]}}}