{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,4,2]],"date-time":"2022-04-02T12:14:20Z","timestamp":1648901660565},"reference-count":25,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1987,1,1]],"date-time":"1987-01-01T00:00:00Z","timestamp":536457600000},"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":["Information Processing Letters"],"published-print":{"date-parts":[[1987,1]]},"DOI":"10.1016\/0020-0190(87)90101-3","type":"journal-article","created":{"date-parts":[[2003,3,14]],"date-time":"2003-03-14T14:37:33Z","timestamp":1047652653000},"page":"97-101","source":"Crossref","is-referenced-by-count":1,"title":["On determining the on-line minimax linear fit to a discrete point set in the plane"],"prefix":"10.1016","volume":"24","author":[{"given":"Claudio","family":"Rey","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Rabab","family":"Ward","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"5","key":"10.1016\/0020-0190(87)90101-3_BIB1","doi-asserted-by":"crossref","first-page":"216","DOI":"10.1016\/0020-0190(79)90072-3","article-title":"Another efficient algorithm for convex hulls in two dimensions","volume":"9","author":"Andrew","year":"1979","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(87)90101-3_BIB2","series-title":"Computational Geometry","article-title":"Simple on-line algorithms for convex polygons","author":"Avis","year":"1985"},{"issue":"2","key":"10.1016\/0020-0190(87)90101-3_BIB3","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1016\/0898-1221(82)90054-2","article-title":"On the multimodality of distances in convex polygons","volume":"8","author":"Avis","year":"1982","journal-title":"Comput. Math. & Appl."},{"issue":"3","key":"10.1016\/0020-0190(87)90101-3_BIB4","doi-asserted-by":"crossref","first-page":"264","DOI":"10.1145\/355644.355651","article-title":"Solution to an overdetermined system of linear equations in the Chebyshev norm","volume":"1","author":"Barrodale","year":"1975","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0020-0190(87)90101-3_BIB5","series-title":"Proc. 4th Manitoba Conf. on Numerical Mathematics","first-page":"177","article-title":"An improved algorithm for discrete Chebyshev linear approximation","author":"Barrodale","year":"1974"},{"issue":"2","key":"10.1016\/0020-0190(87)90101-3_BIB6","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1016\/0020-0190(78)90051-0","article-title":"Divide and conquer in linear expected time","volume":"7","author":"Bentley","year":"1978","journal-title":"Inform. Process. Lett."},{"issue":"6","key":"10.1016\/0020-0190(87)90101-3_BIB7","doi-asserted-by":"crossref","first-page":"296","DOI":"10.1016\/0020-0190(78)90021-2","article-title":"Convex hull of a finite set of points in two dimensions","volume":"7","author":"Bykat","year":"1978","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(87)90101-3_BIB8","series-title":"Introduction to Approximation Theory","author":"Cheney","year":"1966"},{"key":"10.1016\/0020-0190(87)90101-3_BIB9_1","doi-asserted-by":"crossref","first-page":"398","DOI":"10.1145\/355759.355766","article-title":"A new convex hull algorithm for planar sets","volume":"3","author":"Eddy","year":"1977","journal-title":"ACM Trans. Math. Software"},{"key":"10.1016\/0020-0190(87)90101-3_BIB9_2","doi-asserted-by":"crossref","first-page":"411","DOI":"10.1145\/355759.355768","article-title":"A new convex hull algorithm for planar sets","volume":"3","author":"Eddy","year":"1977","journal-title":"ACM Trans. Math. Software"},{"issue":"4","key":"10.1016\/0020-0190(87)90101-3_BIB10","doi-asserted-by":"crossref","first-page":"132","DOI":"10.1016\/0020-0190(72)90045-2","article-title":"An efficient algorithm for determining the convex hull of a finite planar set","volume":"1","author":"Graham","year":"1972","journal-title":"Inform. Process. Lett."},{"issue":"1","key":"10.1016\/0020-0190(87)90101-3_BIB11","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/0020-0190(73)90020-3","article-title":"on the identification of the convex hull of a finite set of points in the plane","volume":"2","author":"Jarvis","year":"1973","journal-title":"Inform. Process. Lett."},{"key":"10.1016\/0020-0190(87)90101-3_BIB12","volume":"Vol. 3","author":"Knuth","year":"1973"},{"key":"10.1016\/0020-0190(87)90101-3_BIB13","series-title":"Fortran subroutine that calculates the minimax solution of linear equations subject to bounds on the variables","author":"Madsen","year":"1975"},{"issue":"2","key":"10.1016\/0020-0190(87)90101-3_BIB14","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","article-title":"Maintenance of configurations in the plane","volume":"23","author":"Overmars","year":"1981","journal-title":"J. Comput. System Sci."},{"key":"10.1016\/0020-0190(87)90101-3_BIB15","series-title":"Methods of Numerical Approximation","article-title":"The exchange algorithm on a discrete point set","author":"Powell","year":"1966"},{"key":"10.1016\/0020-0190(87)90101-3_BIB16_1","series-title":"Minimax solution of linear equations subject to bounds on the variables","author":"Powell","year":"1974"},{"key":"10.1016\/0020-0190(87)90101-3_BIB16_2","series-title":"presented at the 4th Manitoba Conf. on Numerical Mathematics and Computing","author":"Powell","year":"1974"},{"issue":"7","key":"10.1016\/0020-0190(87)90101-3_BIB17","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1145\/359131.359132","article-title":"An optimal real time algorithm for planar convex hulls","volume":"22","author":"Preparata","year":"1979","journal-title":"Comm. ACM"},{"issue":"2","key":"10.1016\/0020-0190(87)90101-3_BIB18","doi-asserted-by":"crossref","first-page":"87","DOI":"10.1145\/359423.359430","article-title":"Convex hulls of finite sets in two or three dimensions","volume":"20","author":"Preparata","year":"1977","journal-title":"Comm. ACM"},{"key":"10.1016\/0020-0190(87)90101-3_BIB19","series-title":"Proc. 7th Ann. ACM Symp. on Theory of Computing","first-page":"224","article-title":"Geometric complexity","author":"Shamos","year":"1975"},{"key":"10.1016\/0020-0190(87)90101-3_BIB20","first-page":"68","article-title":"Computational geometry","author":"Shamos","year":"1978"},{"key":"10.1016\/0020-0190(87)90101-3_BIB21","series-title":"Proc. 1983 Mediterranean Electrical Engineering Conf. MELECON","first-page":"A10.02","article-title":"Solving geometric problems with the \u201crotating calipers\u201d","author":"Toussaint","year":"1983"},{"issue":"3","key":"10.1016\/0020-0190(87)90101-3_BIB22","first-page":"197","article-title":"Complexity, convexity, and unimodality","volume":"13","author":"Toussaint","year":"1984","journal-title":"Internat. J. Comput. Engrg. Sci."},{"key":"10.1016\/0020-0190(87)90101-3_BIB23","series-title":"Proc. IASTED Internat. Symp. on Robotics and Automation","article-title":"On the complexity of approximating polygonal curves in the plane","author":"Toussaint","year":"1985"}],"container-title":["Information Processing Letters"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901013?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0020019087901013?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2019,3,26]],"date-time":"2019-03-26T05:51:53Z","timestamp":1553579513000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0020019087901013"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1987,1]]},"references-count":25,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1987,1]]}},"alternative-id":["0020019087901013"],"URL":"https:\/\/doi.org\/10.1016\/0020-0190(87)90101-3","relation":{},"ISSN":["0020-0190"],"issn-type":[{"value":"0020-0190","type":"print"}],"subject":[],"published":{"date-parts":[[1987,1]]}}}