{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T22:56:07Z","timestamp":1725663367220},"publisher-location":"Berlin, Heidelberg","reference-count":20,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540515425"},{"type":"electronic","value":"9783540482376"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1989]]},"DOI":"10.1007\/3-540-51542-9_16","type":"book-chapter","created":{"date-parts":[[2012,2,25]],"date-time":"2012-02-25T21:06:15Z","timestamp":1330203975000},"page":"183-191","source":"Crossref","is-referenced-by-count":10,"title":["Weighted orthogonal linear L \u221e-approximation and applications"],"prefix":"10.1007","author":[{"given":"Michael E.","family":"Houle","sequence":"first","affiliation":[]},{"given":"Hiroshi","family":"Imai","sequence":"additional","affiliation":[]},{"given":"Keiko","family":"Imai","sequence":"additional","affiliation":[]},{"given":"Jean-Marc","family":"Robert","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2005,5,26]]},"reference":[{"key":"16_CR1","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1016\/0020-0190(87)90226-2","volume":"25","author":"M. Atallah","year":"1987","unstructured":"Atallah, M. and Bajaj, C. Efficient Algorithms for Common Transversals, Inf. Proc. Letters 25 (1987), pp. 87\u201391.","journal-title":"Inf. Proc. Letters"},{"key":"16_CR2","doi-asserted-by":"crossref","unstructured":"Avis, D. and Doskas, M. Algorithms for High Dimensional Stabbing Problems, Tech. Rept. SOCS-87.2, McGill Univ., January 1987.","DOI":"10.1007\/978-3-642-83539-1_7"},{"key":"16_CR3","unstructured":"Avis, D., Robert, J.-M., and Wenger, R. Lower Bounds for Line Stabbing, in preparation."},{"key":"16_CR4","unstructured":"Bajaj, C. and Li, M. On the Duality of Intersection and Closest Points, in \u201cProc. 21 st Ann. Allerton Conf. 1983\u201d, pp. 459\u2013460."},{"volume-title":"Multidimensional Analytic Geometry","year":"1969","author":"K. Borsuk","key":"16_CR5","unstructured":"Borsuk, K. Multidimensional Analytic Geometry, Polish Scientific Publishers, Warsaw, 1969."},{"volume-title":"Geometric Transforms for Fast Geometric Algorithms","year":"1980","author":"K. Q. Brown","key":"16_CR6","unstructured":"Brown, K. Q. Geometric Transforms for Fast Geometric Algorithms, Ph.D. Thesis, Rep. CMU-CS-80-101, Dept. Comp. Sci., Carnegie-Mellon Univ., Pittsburgh, PA, 1980."},{"volume-title":"Linear Programming","year":"1983","author":"V. Chv\u00e1tal","key":"16_CR7","unstructured":"Chv\u00e1tal, V. Linear Programming, W. H. Freeman and Co., New York, 1983."},{"key":"16_CR8","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1016\/0304-3975(85)90005-2","volume":"35","author":"H. Edelsbrunner","year":"1985","unstructured":"Edelsbrunner, H. Finding Transversals for Sets of Simple Geometric Figures, Theo. Comp. Sc. 35 (1985), pp. 55\u201369.","journal-title":"Theo. Comp. Sc."},{"key":"16_CR9","unstructured":"Edelsbrunner, H., Guibas, L. J., and Sharir, M. The Upper Envelope of Piecewise Linear Functions: Algorithms and Applications, Tech. Rept. UIUCDCS-R-87-1390, Univ. of Illinois at Urbana-Champaign, November 1987."},{"key":"16_CR10","doi-asserted-by":"crossref","first-page":"274","DOI":"10.1007\/BF01934440","volume":"22","author":"H. Edelsbrunner","year":"1982","unstructured":"Edelsbrunner, H., Maurer, H. A., Preparata, F. P., Rosenberg, A. L., Welzl, E., and Wood, D. Stabbing Line Segments, BIT 22 (1982), pp. 274\u2013281.","journal-title":"BIT"},{"key":"16_CR11","unstructured":"Hershberger, J. private communication."},{"key":"16_CR12","unstructured":"Houle, M. E. and Robert, J.-M. Orthogonal Weighted Linear Approximation and Applications, Tech. Rept. SOCS-88.13, McGill Univ., August 1988."},{"key":"16_CR13","doi-asserted-by":"crossref","first-page":"761","DOI":"10.1109\/34.6790","volume":"10","author":"M. E. Houle","year":"1988","unstructured":"Houle, M. E. and Toussaint, G. T. Computing the Width of a Set, IEEE Trans. Pattern Anal. Machine Intell. 10 (1988), pp. 761\u2013765.","journal-title":"IEEE Trans. Pattern Anal. Machine Intell."},{"key":"16_CR14","unstructured":"Imai, H., Imai, K., and Yamamoto, P. Algorithms for Orthogonal L 1 Linear Approximation of Points in Two and Higher Dimensions, \u201c13 th Int. Symp. on Math. Prog. 1988\u201d, Tokyo."},{"key":"16_CR15","doi-asserted-by":"crossref","first-page":"248","DOI":"10.1016\/0146-664X(82)90011-9","volume":"19","author":"Y. Kurozumi","year":"1982","unstructured":"Kurozumi, Y. and Davis, W. A. Polygonal Approximation by the Minimax Method, Computer Graphics and Image Processing, 19 (1982), pp. 248\u2013264.","journal-title":"Computer Graphics and Image Processing"},{"key":"16_CR16","doi-asserted-by":"crossref","first-page":"193","DOI":"10.1007\/BF01840442","volume":"1","author":"D. T. Lee","year":"1986","unstructured":"Lee, D. T. and Wu, Y. F. Geometric Complexity of Some Location Problems, Algorithmica 1 (1986), pp. 193\u2013212.","journal-title":"Algorithmica"},{"key":"16_CR17","doi-asserted-by":"crossref","first-page":"90","DOI":"10.1016\/0377-2217(83)90183-2","volume":"12","author":"J. G. Morris","year":"1983","unstructured":"Morris, J. G. and Norback, J. P. Linear Facility Location \u2014 Solving Extensions of the Basic Problem, Eur. J. Oper. Res. 12 (1983), pp. 90\u201394.","journal-title":"Eur. J. Oper. Res."},{"key":"16_CR18","doi-asserted-by":"publisher","first-page":"87","DOI":"10.1145\/359423.359430","volume":"20","author":"F. P. Preparata","year":"1977","unstructured":"Preparata, F. P. and Hong, S. J. Convex Hulls of Finite Sets of Points in Two and Three Dimensions, Comm. ACM 20 (1977), pp. 87\u201393.","journal-title":"Comm. ACM"},{"key":"16_CR19","unstructured":"Seidel, R. A Convex Hull Algorithm Optimal for Points in Even Dimensions, Tech. Rept. 81-14, Univ. British Columbia, 1981."},{"key":"16_CR20","doi-asserted-by":"crossref","unstructured":"Yamamoto, P., Kato, K., Imai, K. and Imai, H. Algorithms for Vertical and Orthogonal L 1 Linear Approximation of Points, in \u201cProc. 4 th Ann. ACM Symp. Comp. Geom., 1988\u201d, pp. 352\u2013361.","DOI":"10.1145\/73393.73429"}],"container-title":["Lecture Notes in Computer Science","Algorithms and Data Structures"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-51542-9_16.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,12,31]],"date-time":"2021-12-31T02:56:56Z","timestamp":1640919416000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-51542-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1989]]},"ISBN":["9783540515425","9783540482376"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/3-540-51542-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1989]]}}}