{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T03:30:10Z","timestamp":1725507010237},"publisher-location":"Berlin, Heidelberg","reference-count":16,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540787723"},{"type":"electronic","value":"9783540787730"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-78773-0_55","type":"book-chapter","created":{"date-parts":[[2008,4,3]],"date-time":"2008-04-03T08:38:35Z","timestamp":1207211915000},"page":"642-653","source":"Crossref","is-referenced-by-count":4,"title":["Weighted Rectilinear Approximation of Points in the Plane"],"prefix":"10.1007","author":[{"given":"Mario A.","family":"Lopez","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Yan","family":"Mayster","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"55_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1142\/S0218195906001951","volume":"16","author":"B. Aronov","year":"2006","unstructured":"Aronov, B., Asano, T., Katoh, N., Mehlhorn, K., Tokuyama, T.: Polyline fitting of planar points under min-sum criteria. International Journal of Computational Geometry and Applications\u00a016, 97\u2013116 (2006)","journal-title":"International Journal of Computational Geometry and Applications"},{"key":"55_CR2","doi-asserted-by":"crossref","unstructured":"Brodal, G., Jacob, R.: Dynamic planar convex hull. In: Proceedings of the 43rd IEEE Symposium on Foundations of Computer Science, pp. 617\u2013626 (2002)","DOI":"10.1109\/SFCS.2002.1181985"},{"key":"55_CR3","doi-asserted-by":"publisher","first-page":"214","DOI":"10.1016\/S0377-2217(00)00023-0","volume":"130","author":"J.M. D\u00edaz-B\u00e1\u00f1ez","year":"2001","unstructured":"D\u00edaz-B\u00e1\u00f1ez, J.M., Mesa, J.A.: Fitting rectilinear polygonal curves to a set of points in the plane. European Journal of Operations Research\u00a0130, 214\u2013222 (2001)","journal-title":"European Journal of Operations Research"},{"issue":"3","key":"55_CR4","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1006\/cgip.1994.1021","volume":"56","author":"D. Eu","year":"1994","unstructured":"Eu, D., Toussaint, G.: On approximating polygonal curves in two and three dimensions. CVGIP: Graphical Models and Image Processing\u00a056(3), 231\u2013246 (1994)","journal-title":"CVGIP: Graphical Models and Image Processing"},{"key":"55_CR5","doi-asserted-by":"publisher","first-page":"445","DOI":"10.1007\/BF02570717","volume":"14","author":"M. Goodrich","year":"1995","unstructured":"Goodrich, M.: Efficient piecewise-linear function approximation using the uniform metric. Discrete and Computational Geometry\u00a014, 445\u2013462 (1995)","journal-title":"Discrete and Computational Geometry"},{"issue":"2","key":"55_CR6","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1016\/1049-9652(91)90056-P","volume":"53","author":"S.L. Hakimi","year":"1991","unstructured":"Hakimi, S.L., Schmeichel, E.F.: Fitting polygonal functions to a set of points in the plane. CVGIP: Graphical Models and Image Processing\u00a053(2), 132\u2013136 (1991)","journal-title":"CVGIP: Graphical Models and Image Processing"},{"key":"55_CR7","doi-asserted-by":"publisher","first-page":"453","DOI":"10.1006\/jagm.1996.0054","volume":"21","author":"J. Hershberger","year":"1996","unstructured":"Hershberger, J., Suri, S.: Off-line maintenance of planar configurations. Journal of Algorithms\u00a021, 453\u2013475 (1996)","journal-title":"Journal of Algorithms"},{"issue":"3","key":"55_CR8","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/0166-218X(93)90113-3","volume":"43","author":"M. Houle","year":"1993","unstructured":"Houle, M., Imai, H., Imai, K., Robert, J.-M., Yamamoto, P.: Orthogonal weighted linear L 1 and L \u2009\u221e\u2009 approximation and applications. Discrete Applied Mathematics\u00a043(3), 217\u2013232 (1993)","journal-title":"Discrete Applied Mathematics"},{"issue":"1","key":"55_CR9","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/S0734-189X(86)80027-5","volume":"36","author":"H. Imai","year":"1986","unstructured":"Imai, H., Iri, M.: Computational-geometric methods for polygonal approximations of a curve. Computer Vision, Graphics and Image Processing\u00a036(1), 31\u201341 (1986)","journal-title":"Computer Vision, Graphics and Image Processing"},{"key":"55_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"715","DOI":"10.1007\/11682462_65","volume-title":"LATIN 2006: Theoretical Informatics","author":"Y. Mayster","year":"2006","unstructured":"Mayster, Y., Lopez, M.A.: Rectilinear approximation of a set of points in the plane. In: Correa, J.R., Hevia, A., Kiwi, M. (eds.) LATIN 2006. LNCS, vol.\u00a03887, pp. 715\u2013726. Springer, Heidelberg (2006)"},{"issue":"1","key":"55_CR11","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1145\/2422.322418","volume":"31","author":"N. Megiddo","year":"1984","unstructured":"Megiddo, N.: Linear programming in linear time when the dimension is fixed. Journal of ACM\u00a031(1), 114\u2013127 (1984)","journal-title":"Journal of ACM"},{"key":"55_CR12","doi-asserted-by":"crossref","unstructured":"Melkman, A., O\u2019Rourke, J.: On polygonal chain approximation. In: Toussaint, G.T. (ed.) Computational Morphology, pp. 87\u201395, North-Holland, Amsterdam, Netherlands (1988)","DOI":"10.1016\/B978-0-444-70467-2.50012-6"},{"issue":"2","key":"55_CR13","doi-asserted-by":"publisher","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"M.H. Overmars","year":"1981","unstructured":"Overmars, M.H., van Leeuwen, J.: Maintenance of configurations in the plane. Journal of Computer and System Sciences\u00a023(2), 166\u2013204 (1981)","journal-title":"Journal of Computer and System Sciences"},{"key":"55_CR14","doi-asserted-by":"crossref","unstructured":"Seidel, R.: Linear programming and convex hulls made easy. In: SCG 1990: Proceedings of the Sixth Annual Symposium on Computational Geometry, pp. 211\u2013215 (1990)","DOI":"10.1145\/98524.98570"},{"key":"55_CR15","doi-asserted-by":"publisher","first-page":"329","DOI":"10.1016\/S0167-8655(01)00130-1","volume":"23","author":"D.P. Wang","year":"2002","unstructured":"Wang, D.P.: A new algorithms for fitting a rectilinear x-monotone curve to a set of points in the plane. Pattern Recognition Letters\u00a023, 329\u2013334 (2002)","journal-title":"Pattern Recognition Letters"},{"key":"55_CR16","doi-asserted-by":"crossref","unstructured":"Yamamoto, P., Kato, K., Imai, K., Imai, H.: Algorithms for vertical and orthogonal L 1 linear approximation of points. In: Proceedings of the 4th Annual Symposium on Computational Geometry, pp. 352\u2013361 (1988)","DOI":"10.1145\/73393.73429"}],"container-title":["Lecture Notes in Computer Science","LATIN 2008: Theoretical Informatics"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-78773-0_55.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,4,27]],"date-time":"2021-04-27T11:21:46Z","timestamp":1619522506000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-78773-0_55"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540787723","9783540787730"],"references-count":16,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-78773-0_55","relation":{},"subject":[]}}