{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,11]],"date-time":"2026-03-11T15:04:48Z","timestamp":1773241488496,"version":"3.50.1"},"reference-count":15,"publisher":"Elsevier BV","issue":"4","license":[{"start":{"date-parts":[[1997,9,1]],"date-time":"1997-09-01T00:00:00Z","timestamp":873072000000},"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":5798,"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,9]]},"DOI":"10.1016\/s0925-7721(96)00011-9","type":"journal-article","created":{"date-parts":[[2003,4,23]],"date-time":"2003-04-23T19:57:07Z","timestamp":1051127827000},"page":"167-179","source":"Crossref","is-referenced-by-count":20,"title":["Translating a convex polygon to contain a maximum number of points"],"prefix":"10.1016","volume":"8","author":[{"given":"Gill","family":"Barequet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Matthew","family":"Dickerson","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Petru","family":"Pau","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"key":"10.1016\/S0925-7721(96)00011-9_BIB1","series-title":"Advances in Computing Research 1","first-page":"1","article-title":"The polygon placement problem","author":"Chazelle","year":"1983"},{"issue":"2","key":"10.1016\/S0925-7721(96)00011-9_BIB2","doi-asserted-by":"crossref","first-page":"191","DOI":"10.1142\/S0218195992000123","article-title":"A parallel algorithm for enclosed and enclosing triangles","volume":"2","author":"Chandran","year":"1992","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0925-7721(96)00011-9_BIB3","series-title":"Proc. 7th ACM-SIAM Symp. Discrete Algorithms","article-title":"Optimal placement of convex polygons to maximize point containment","author":"Dickerson","year":"1996"},{"key":"10.1016\/S0925-7721(96)00011-9_BIB4","doi-asserted-by":"crossref","first-page":"321","DOI":"10.1007\/BF02574012","article-title":"Iterated nearest neighbors and finding minimal polytopes","volume":"11","author":"Eppstein","year":"1994","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(96)00011-9_BIB5","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1016\/0925-7721(94)90003-5","article-title":"Computing the smallest k-enclosing circle and related problems","volume":"4","author":"Efrat","year":"1994","journal-title":"Computational Geometry"},{"key":"10.1016\/S0925-7721(96)00011-9_BIB6","series-title":"Proc. 1st Internat. Conf. Computer Vision","first-page":"102","article-title":"Object recognition using alignment","author":"Huttenlocher","year":"1987"},{"key":"10.1016\/S0925-7721(96)00011-9_BIB7","doi-asserted-by":"crossref","first-page":"359","DOI":"10.1016\/0196-6774(85)90005-7","article-title":"Finding the smallest triangles containing a given convex polygon","volume":"6","author":"Klee","year":"1985","journal-title":"J. Algorithms"},{"key":"10.1016\/S0925-7721(96)00011-9_BIB8","series-title":"Proc. 9th ACM Symp. Comput. Geom.","first-page":"133","article-title":"Tentative prune-and-search for computing fixed-points with applications to geometric computing","author":"Kirkpatrick","year":"1993"},{"key":"10.1016\/S0925-7721(96)00011-9_BIB9","doi-asserted-by":"crossref","first-page":"273","DOI":"10.1142\/S0218195995000167","article-title":"Sequential and parallel algorithms for the k closest pairs problem","volume":"5","author":"Lenhof","year":"1995","journal-title":"Internat. J. Comput. Geom. Appl."},{"key":"10.1016\/S0925-7721(96)00011-9_BIB10","series-title":"Proc. IEEE Conf. on Computer Vision and Pattern Recognition","article-title":"Object recognition by affine invariant matching","author":"Lamdan","year":"1988"},{"key":"10.1016\/S0925-7721(96)00011-9_BIB11","doi-asserted-by":"crossref","first-page":"258","DOI":"10.1016\/0196-6774(86)90007-6","article-title":"An optimal algorithm for finding minimal enclosing triangles","volume":"7","author":"O'Rourke","year":"1986","journal-title":"J. Algorithms"},{"key":"10.1016\/S0925-7721(96)00011-9_BIB12","doi-asserted-by":"crossref","first-page":"1034","DOI":"10.1137\/0220065","article-title":"New upper bounds in Klee's measure problem","volume":"20","author":"Overmars","year":"1991","journal-title":"SIAM J. Comput."},{"key":"10.1016\/S0925-7721(96)00011-9_BIB13","series-title":"Computational Geometry: An Introduction","author":"Preparata","year":"1985"},{"key":"10.1016\/S0925-7721(96)00011-9_BIB14","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1007\/BF02574706","article-title":"On k-sets in arrangements of curves and surfaces","volume":"6","author":"Sharir","year":"1991","journal-title":"Discrete Comput. Geom."},{"key":"10.1016\/S0925-7721(96)00011-9_BIB15","series-title":"Proc. IEEE MELECON","article-title":"Solving geometric problems with the rotating calipers","author":"Toussaint","year":"1983"}],"container-title":["Computational Geometry"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772196000119?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S0925772196000119?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,4,14]],"date-time":"2019-04-14T03:25:26Z","timestamp":1555212326000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S0925772196000119"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1997,9]]},"references-count":15,"journal-issue":{"issue":"4","published-print":{"date-parts":[[1997,9]]}},"alternative-id":["S0925772196000119"],"URL":"https:\/\/doi.org\/10.1016\/s0925-7721(96)00011-9","relation":{},"ISSN":["0925-7721"],"issn-type":[{"value":"0925-7721","type":"print"}],"subject":[],"published":{"date-parts":[[1997,9]]}}}