{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,2]],"date-time":"2025-11-02T16:27:28Z","timestamp":1762100848167,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540877431"},{"type":"electronic","value":"9783540877448"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87744-8_37","type":"book-chapter","created":{"date-parts":[[2008,8,30]],"date-time":"2008-08-30T09:20:52Z","timestamp":1220088052000},"page":"442-453","source":"Crossref","is-referenced-by-count":9,"title":["Fitting a Step Function to a Point Set"],"prefix":"10.1007","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","reference":[{"key":"37_CR1","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Har-Peled, S., Yu, H.: Robust shape fitting via peeling and grating coresets. In: Proc. 17th Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 182\u2013191 (2006)","DOI":"10.1145\/1109557.1109579"},{"key":"37_CR2","doi-asserted-by":"crossref","unstructured":"Agarwal, P.K., Sharir, M.: Efficient algorithms for geometric optimization. Computing Surveys\u00a030 (1998)","DOI":"10.1145\/299917.299918"},{"key":"37_CR3","unstructured":"Atanassov, R., Bose, P., Couture, M., Maheshwari, A., Morin, P., Paquette, M., Smid, M., Wuhrer, S.: Algorithms for optimal outlier removal. Journal of Discrete Algorithms (to appear)"},{"key":"37_CR4","doi-asserted-by":"crossref","unstructured":"Buragohain, C., Shrivastava, N., Suri, S.: Space efficient streaming algorithms for the maximum error histogram. In: 23rd International Conference on Data Engineering, pp. 1026\u20131035 (2007)","DOI":"10.1109\/ICDE.2007.368961"},{"key":"37_CR5","unstructured":"Chazal, F., Das, S.: An efficient algorithm for fitting rectilinear x - monotone curve to a point set in a plane. Technical report (August 2006), \n                      http:\/\/math.u-bourgogne.fr\/IMB\/chazal\/publications.htm"},{"key":"37_CR6","unstructured":"Frederickson, G.N.: Optimal algorithms for tree partitioning. In: Proc. 2nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 168\u2013177 (1991)"},{"issue":"1","key":"37_CR7","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1137\/0213002","volume":"13","author":"G.N. Frederickson","year":"1984","unstructured":"Frederickson, G.N., Johnson, D.B.: Generalized selection and ranking: Sorted matrices. SIAM Journal on Computing\u00a013(1), 14\u201330 (1984)","journal-title":"SIAM Journal on Computing"},{"key":"37_CR8","doi-asserted-by":"crossref","unstructured":"Gabow, H.N., Bentley, J.L., Tarjan, R.E.: Scaling and related techniques for geometry problems. In: Proc. 16th Annual ACM Symposium on Theory of Computing, pp. 135\u2013143 (1984)","DOI":"10.1145\/800057.808675"},{"issue":"4","key":"37_CR9","doi-asserted-by":"crossref","first-page":"445","DOI":"10.1007\/BF02570717","volume":"14","author":"M.T. Goodrich","year":"1995","unstructured":"Goodrich, M.T.: Efficient piecewise-linear function approximation using the uniform metric. Discrete and Computational Geometry\u00a014(4), 445\u2013462 (1995)","journal-title":"Discrete and Computational Geometry"},{"issue":"7","key":"37_CR10","doi-asserted-by":"publisher","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 Transactions on Knowledge and Data Engineering\u00a019(7), 993\u2013997 (2007)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"issue":"2","key":"37_CR11","doi-asserted-by":"publisher","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 Journal on Computing\u00a033(2), 269\u2013285 (2004)","journal-title":"SIAM Journal on Computing"},{"issue":"2","key":"37_CR12","doi-asserted-by":"publisher","first-page":"338","DOI":"10.1137\/0213024","volume":"13","author":"D. Harel","year":"1984","unstructured":"Harel, D., Tarjan, R.E.: Fast algorithms for finding nearest common ancestors. SIAM Journal on Computing\u00a013(2), 338\u2013355 (1984)","journal-title":"SIAM Journal on Computing"},{"issue":"3","key":"37_CR13","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.\u00a018(3), 10\u201318 (1995)","journal-title":"IEEE Data Eng. Bull."},{"key":"37_CR14","doi-asserted-by":"crossref","unstructured":"Karras, P., Sacharidis, D., Mamoulis, N.: Exploiting duality in summarization with deterministic guarantees. In: 13th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 380\u2013389 (2007)","DOI":"10.1145\/1281192.1281235"},{"key":"37_CR15","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"642","DOI":"10.1007\/978-3-540-78773-0_55","volume-title":"LATIN 2008: Theoretical Informatics","author":"M. Lopez","year":"2008","unstructured":"Lopez, M., Mayster, Y.: Weighted rectilinear approximation of points in the plane. In: Laber, E.S., Bornstein, C., Nogueira, L.T., Faria, L. (eds.) LATIN 2008. LNCS, vol.\u00a04957, pp. 642\u2013653. Springer, Heidelberg (2008)"},{"issue":"6","key":"37_CR16","doi-asserted-by":"publisher","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. Journal of Visual Comunication and Image Represententation\u00a017(6), 1178\u20131189 (2006)","journal-title":"Journal of Visual Comunication and Image Represententation"},{"issue":"1","key":"37_CR17","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 Operational Research\u00a0130(1), 214\u2013222 (2001)","journal-title":"European Journal of Operational Research"},{"issue":"1-3","key":"37_CR18","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 algorithm for fitting a rectilinear x-monotone curve to a set of points in the plane. Pattern Recognition Letters\u00a023(1-3), 329\u2013334 (2002)","journal-title":"Pattern Recognition Letters"}],"container-title":["Lecture Notes in Computer Science","Algorithms - ESA 2008"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87744-8_37","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,5,7]],"date-time":"2024-05-07T05:17:49Z","timestamp":1715059069000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-540-87744-8_37"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540877431","9783540877448"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87744-8_37","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}