{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:29:14Z","timestamp":1762100954958},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2009,7,9]],"date-time":"2009-07-09T00:00:00Z","timestamp":1247097600000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Algorithmica"],"published-print":{"date-parts":[[2011,5]]},"DOI":"10.1007\/s00453-009-9342-z","type":"journal-article","created":{"date-parts":[[2009,7,8]],"date-time":"2009-07-08T14:07:42Z","timestamp":1247062062000},"page":"95-109","source":"Crossref","is-referenced-by-count":12,"title":["Fitting a Step Function to a Point Set"],"prefix":"10.1007","volume":"60","author":[{"given":"Herv\u00e9","family":"Fournier","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Antoine","family":"Vigneron","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2009,7,9]]},"reference":[{"key":"9342_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Har-Peled, S., Yu, H.: Robust shape fitting via peeling and grating coresets. In: Proceedings of the 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 182\u2013191 (2006)","DOI":"10.1145\/1109557.1109579"},{"key":"9342_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P., Sharir, M.: Efficient algorithms for geometric optimization. Comput. Surv. 30 (1998)","DOI":"10.1145\/299917.299918"},{"key":"9342_CR3","doi-asserted-by":"crossref","first-page":"263","DOI":"10.1007\/BF02574380","volume":"12","author":"A. Aggarwal","year":"1994","unstructured":"Aggarwal, A., Schieber, B., Tokuyama, T.: Finding a minimum-weight k-link path in graphs with the concave Monge property and applications. Discrete Comput. Geom. 12, 263\u2013280 (1994)","journal-title":"Discrete Comput. Geom."},{"issue":"7","key":"9342_CR4","doi-asserted-by":"crossref","first-page":"239","DOI":"10.1016\/j.jda.2008.12.002","volume":"2","author":"R. Atanassov","year":"2009","unstructured":"Atanassov, R., Bose, P., Couture, M., Maheshwari, A., Morin, P., Paquette, M., Smid, M., Wuhrer, S.: Algorithms for optimal outlier removal. J.\u00a0Discrete Algorithms 2(7), 239\u2013248 (2009)","journal-title":"J.\u00a0Discrete Algorithms"},{"key":"9342_CR5","doi-asserted-by":"crossref","unstructured":"Ben-Or, M.: Lower bounds for algebraic computation trees. In: Proceedings of the 15th Annual ACM Symposium on Theory of Computing, pp. 80\u201386 (1983)","DOI":"10.1145\/800061.808735"},{"key":"9342_CR6","doi-asserted-by":"crossref","unstructured":"Bender, M., Farach-Colton, M.: The LCA problem revisited. In: Proceedings of the LATIN 2000: Theoretical Informatics, 4th Latin American Symposium, pp. 88\u201394 (2000)","DOI":"10.1007\/10719839_9"},{"key":"9342_CR7","doi-asserted-by":"crossref","unstructured":"Buragohain, C., Shrivastava, N., Suri, S.: Space efficient streaming algorithms for the maximum error histogram. In: Proceedings of the 23rd International Conference on Data Engineering, pp. 1026\u20131035 (2007)","DOI":"10.1109\/ICDE.2007.368961"},{"key":"9342_CR8","doi-asserted-by":"crossref","DOI":"10.1007\/978-3-662-03338-8","volume-title":"Algebraic Complexity Theory","author":"P. B\u00fcrgisser","year":"1997","unstructured":"B\u00fcrgisser, P., Clausen, M., Shokrollahi, M.: Algebraic Complexity Theory. Springer, Berlin (1997)"},{"key":"9342_CR9","unstructured":"Frederickson, G.: Optimal algorithms for tree partitioning. In: Proceedings of the 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 168\u2013177 (1991)"},{"issue":"1","key":"9342_CR10","doi-asserted-by":"crossref","first-page":"14","DOI":"10.1137\/0213002","volume":"13","author":"G. Frederickson","year":"1984","unstructured":"Frederickson, G., Johnson, D.: Generalized selection and ranking: Sorted matrices. SIAM J. Comput. 13(1), 14\u201330 (1984)","journal-title":"SIAM J. Comput."},{"key":"9342_CR11","doi-asserted-by":"crossref","unstructured":"Gabow, H., Bentley, J., Tarjan, R.: Scaling and related techniques for geometry problems. In: Proceedings of the 16th Annual ACM Symposium on Theory of Computing, pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"issue":"4","key":"9342_CR12","doi-asserted-by":"crossref","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 Comput. Geom. 14(4), 445\u2013462 (1995)","journal-title":"Discrete Comput. Geom."},{"issue":"7","key":"9342_CR13","doi-asserted-by":"crossref","first-page":"993","DOI":"10.1109\/TKDE.2007.1039","volume":"19","author":"S. Guha","year":"2007","unstructured":"Guha, S., Shim, K.: A note on linear time algorithms for maximum error histograms. IEEE Trans. Knowl. Data Eng. 19(7), 993\u2013997 (2007)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"2","key":"9342_CR14","doi-asserted-by":"crossref","first-page":"269","DOI":"10.1137\/S0097539703427963","volume":"33","author":"S. Har-Peled","year":"2004","unstructured":"Har-Peled, S., Wang, Y.: Shape fitting with outliers. SIAM J. Comput. 33(2), 269\u2013285 (2004)","journal-title":"SIAM J. Comput."},{"issue":"2","key":"9342_CR15","doi-asserted-by":"crossref","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.: Fast algorithms for finding nearest common ancestors. SIAM J. Comput. 13(2), 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"issue":"3","key":"9342_CR16","first-page":"10","volume":"18","author":"Y. Ioannidis","year":"1995","unstructured":"Ioannidis, Y., Poosala, V.: Histogram-based solutions to diverse database estimation problems. IEEE Data Eng. Bull. 18(3), 10\u201318 (1995)","journal-title":"IEEE Data Eng. Bull."},{"key":"9342_CR17","doi-asserted-by":"crossref","unstructured":"Karras, P., Sacharidis, D., Mamoulis, N.: Exploiting duality in summarization with deterministic guarantees. In: Proceedings of the 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 380\u2013389 (2007)","DOI":"10.1145\/1281192.1281235"},{"key":"9342_CR18","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"crossref","first-page":"642","DOI":"10.1007\/978-3-540-89173-4","volume-title":"Proceedings of the LATIN 2008: Theoretical Informatics, 7th Latin American Symposium","author":"M. Lopez","year":"2008","unstructured":"Lopez, M., Mayster, Y.: Weighted rectilinear approximation of points in the plane. In: Proceedings of the LATIN 2008: Theoretical Informatics, 7th Latin American Symposium. Lecture Notes in Computer Science, vol.\u00a04957, pp. 642\u2013653. Springer, Berlin (2008)"},{"issue":"6","key":"9342_CR19","doi-asserted-by":"crossref","first-page":"1178","DOI":"10.1016\/j.jvcir.2006.04.002","volume":"17","author":"Y. Mayster","year":"2006","unstructured":"Mayster, Y., Lopez, M.A.: Approximating a set of points by a step function. J.\u00a0Vis. Commun. Image Represent. 17(6), 1178\u20131189 (2006)","journal-title":"J.\u00a0Vis. Commun. Image Represent."},{"issue":"1","key":"9342_CR20","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/S0377-2217(00)00023-0","volume":"130","author":"J. D\u00edaz-B\u00e1\u00f1ez","year":"2001","unstructured":"D\u00edaz-B\u00e1\u00f1ez, J., Mesa, J.: Fitting rectilinear polygonal curves to a set of points in the plane. Eur. J. Oper. Res. 130(1), 214\u2013222 (2001)","journal-title":"Eur. J. Oper. Res."},{"issue":"1\u20133","key":"9342_CR21","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1016\/S0167-8655(01)00130-1","volume":"23","author":"D. Wang","year":"2002","unstructured":"Wang, D.: A new algorithm for fitting a rectilinear x-monotone curve to a set of points in the plane. Pattern Recognit. Lett. 23(1\u20133), 329\u2013334 (2002)","journal-title":"Pattern Recognit. Lett."}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9342-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-009-9342-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-009-9342-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,29]],"date-time":"2019-05-29T09:45:04Z","timestamp":1559123104000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-009-9342-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,7,9]]},"references-count":21,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2011,5]]}},"alternative-id":["9342"],"URL":"https:\/\/doi.org\/10.1007\/s00453-009-9342-z","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009,7,9]]}}}