{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T04:37:27Z","timestamp":1759639047848},"reference-count":59,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2012,5,18]],"date-time":"2012-05-18T00:00:00Z","timestamp":1337299200000},"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":[[2013,7]]},"DOI":"10.1007\/s00453-012-9658-y","type":"journal-article","created":{"date-parts":[[2012,5,17]],"date-time":"2012-05-17T19:57:39Z","timestamp":1337284659000},"page":"682-713","source":"Crossref","is-referenced-by-count":12,"title":["Approximating Points by a Piecewise Linear Function"],"prefix":"10.1007","volume":"66","author":[{"given":"Danny Z.","family":"Chen","sequence":"first","affiliation":[]},{"given":"Haitao","family":"Wang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,5,18]]},"reference":[{"issue":"4","key":"9658_CR1","doi-asserted-by":"crossref","first-page":"1016","DOI":"10.1137\/S0097539794269801","volume":"27","author":"P.K. Agarwal","year":"1998","unstructured":"Agarwal, P.K., Suri, S.: Surface approximation and geometric partitions. SIAM J. Comput. 27(4), 1016\u20131035 (1998)","journal-title":"SIAM J. Comput."},{"key":"9658_CR2","doi-asserted-by":"crossref","first-page":"195","DOI":"10.1007\/BF01840359","volume":"2","author":"A. Aggarwal","year":"1987","unstructured":"Aggarwal, A., Klawe, M., Moran, S., Shor, P., Wilbur, R.: Geometric applications of a matrix-searching algorithm. Algorithmica 2, 195\u2013208 (1987)","journal-title":"Algorithmica"},{"key":"9658_CR3","first-page":"497","volume-title":"Proc. of 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS)","author":"A. Aggarwal","year":"1988","unstructured":"Aggarwal, A., Park, J.: Notes on searching in multidimensional monotone arrays. In: Proc. of 29th Annual IEEE Symposium on Foundations of Computer Science (FOCS), pp. 497\u2013512 (1988)"},{"issue":"2","key":"9658_CR4","doi-asserted-by":"crossref","first-page":"150","DOI":"10.1007\/s00453-001-0096-5","volume":"33","author":"G. Barequet","year":"2002","unstructured":"Barequet, G., Chen, D.Z., Daescu, O., Goodrich, M., Snoeyink, J.: Efficiently approximating polygonal paths in three and higher dimensions. Algorithmica 33(2), 150\u2013167 (2002)","journal-title":"Algorithmica"},{"key":"9658_CR5","first-page":"88","volume-title":"Proc. of the 4th Latin American Symposium on Theoretical Informatics","author":"M. Bender","year":"2000","unstructured":"Bender, M., Farach-Colton, M.: The LCA problem revisited. In: Proc. of the 4th Latin American Symposium on Theoretical Informatics, pp. 88\u201394 (2000)"},{"issue":"2","key":"9658_CR6","doi-asserted-by":"crossref","first-page":"252","DOI":"10.1137\/S0895480101384347","volume":"15","author":"P. Berman","year":"2002","unstructured":"Berman, P., DasGupta, B., Muthukrishnan, S.: Exact size of binary space partitionings and improved rectangle tiling algorithms. SIAM J. Discrete Math. 15(2), 252\u2013267 (2002)","journal-title":"SIAM J. Discrete Math."},{"issue":"2","key":"9658_CR7","doi-asserted-by":"crossref","first-page":"122","DOI":"10.1016\/S0196-6774(03)00015-4","volume":"47","author":"P. Berman","year":"2003","unstructured":"Berman, P., DasGupta, B., Muthukrishnan, S.: Approximation algorithms for max-min tiling. J. Algorithms 47(2), 122\u2013134 (2003)","journal-title":"J. Algorithms"},{"key":"9658_CR8","first-page":"455","volume-title":"Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"P. Berman","year":"2002","unstructured":"Berman, P., DasGupta, B., Muthukrishnan, S.: Slice and dice: A simple, improved approximate tiling recipe. In: Proc. of the 13th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp.\u00a0455\u2013464 (2002)"},{"issue":"2","key":"9658_CR9","doi-asserted-by":"crossref","first-page":"443","DOI":"10.1006\/jagm.2001.1188","volume":"41","author":"P. Berman","year":"2001","unstructured":"Berman, P., DasGupta, B., Muthukrishnan, S., Ramaswami, S.: Efficient approximation algorithms for tiling and packing problems with rectangles. J. Algorithms 41(2), 443\u2013470 (2001)","journal-title":"J. Algorithms"},{"key":"9658_CR10","first-page":"617","volume-title":"Proc. of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS)","author":"G. Brodal","year":"2002","unstructured":"Brodal, G., Jacob, R.: Dynamic planar convex hull. In: Proc. of the 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 617\u2013626 (2002)"},{"key":"9658_CR11","doi-asserted-by":"crossref","first-page":"284","DOI":"10.1145\/237218.237397","volume-title":"Proc. of the 12th Annual ACM Symposium on Computational Geometry","author":"T.M. Chan","year":"1996","unstructured":"Chan, T.M.: Fixed-dimensional linear programming queries made easy. In: Proc. of the 12th Annual ACM Symposium on Computational Geometry, pp. 284\u2013290 (1996)"},{"issue":"3","key":"9658_CR12","doi-asserted-by":"crossref","first-page":"369","DOI":"10.1007\/BF02712874","volume":"16","author":"T.M. Chan","year":"1996","unstructured":"Chan, T.M.: Output-sensitive results on convex hulls and extreme points, and related problems. Discrete Comput. Geom. 16(3), 369\u2013387 (1996)","journal-title":"Discrete Comput. Geom."},{"key":"9658_CR13","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1006\/jagm.1997.0914","volume":"27","author":"T.M. Chan","year":"1998","unstructured":"Chan, T.M.: Deterministic algorithms for 2-D convex programming and 3-D online linear programming. J. Algorithms 27, 147\u2013166 (1998)","journal-title":"J. Algorithms"},{"key":"9658_CR14","first-page":"570","volume-title":"Proc. of 43rd IEEE Symposium on Foundations of Computer Science (FOCS)","author":"T.M. Chan","year":"2002","unstructured":"Chan, T.M.: Low-dimensional linear programming with violations. In: Proc. of 43rd IEEE Symposium on Foundations of Computer Science (FOCS), pp. 570\u2013579 (2002)"},{"key":"9658_CR15","unstructured":"Chazal, F., Das, S.: An efficient algorithm for fitting rectilinear x-monotone curve to a point set in a plane. Technical report, Indian Statistical Institute (2006). http:\/\/math.u-bourgogne.fr\/IMB\/chazal\/lineFitSept06.pdf"},{"issue":"4","key":"9658_CR16","doi-asserted-by":"crossref","first-page":"671","DOI":"10.1137\/0221041","volume":"21","author":"B. Chazelle","year":"1992","unstructured":"Chazelle, B.: An optimal algorithm for intersecting three-dimensional convex polyhedra. SIAM J. Comput. 21(4), 671\u2013696 (1992)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9658_CR17","doi-asserted-by":"crossref","first-page":"133","DOI":"10.1007\/BF01840440","volume":"1","author":"B. Chazelle","year":"1986","unstructured":"Chazelle, B., Guibas, L.: Fractional cascading: I. A\u00a0data structuring technique. Algorithmica 1(1), 133\u2013162 (1986)","journal-title":"Algorithmica"},{"issue":"2","key":"9658_CR18","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/s00454-011-9338-8","volume":"46","author":"D.Z. Chen","year":"2011","unstructured":"Chen, D.Z., Wang, C., Wang, H.: Representing a functional curve by curves with fewer peaks. Discrete Comput. Geom. 46(2), 334\u2013360 (2011)","journal-title":"Discrete Comput. Geom."},{"key":"9658_CR19","doi-asserted-by":"crossref","first-page":"234","DOI":"10.1007\/978-3-642-10631-6_25","volume-title":"Proc. of the 20th International Symposium on Algorithms and Computation (ISAAC)","author":"D.Z. Chen","year":"2009","unstructured":"Chen, D.Z., Wang, H.: Approximating points by a piecewise linear function: II. Dealing with outliers. In: Proc. of the 20th International Symposium on Algorithms and Computation (ISAAC), pp. 234\u2013243 (2009)"},{"issue":"1","key":"9658_CR20","doi-asserted-by":"crossref","first-page":"200","DOI":"10.1145\/7531.7537","volume":"34","author":"R. Cole","year":"1987","unstructured":"Cole, R.: Slowing down sorting networks to obtain faster sorting algorithms. J. ACM 34(1), 200\u2013208 (1987)","journal-title":"J. ACM"},{"key":"9658_CR21","volume-title":"Introduction to Algorithms","author":"T. Cormen","year":"2001","unstructured":"Cormen, T., Leiserson, C., Rivest, R., Stein, C.: Introduction to Algorithms, 2nd edn. MIT Press, Cambridge (2001)","edition":"2"},{"issue":"1","key":"9658_CR22","doi-asserted-by":"crossref","first-page":"214","DOI":"10.1016\/S0377-2217(00)00023-0","volume":"130","author":"J. D\u00edaz-B\u00e1nez","year":"2001","unstructured":"D\u00edaz-B\u00e1nez, 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":"3","key":"9658_CR23","doi-asserted-by":"crossref","first-page":"381","DOI":"10.1016\/0196-6774(85)90007-0","volume":"6","author":"D.P. Dobkin","year":"1985","unstructured":"Dobkin, D.P., Kirkpatrick, D.G.: A linear algorithm for determining the separation of convex polyhedra. J. Algorithms 6(3), 381\u2013392 (1985)","journal-title":"J. Algorithms"},{"issue":"1","key":"9658_CR24","doi-asserted-by":"crossref","first-page":"86","DOI":"10.1016\/0022-0000(89)90034-2","volume":"38","author":"J. Driscoll","year":"1989","unstructured":"Driscoll, J., Sarnak, N., Sleator, D., Tarjan, R.E.: Making data structures persistent. J. Comput. Syst. Sci. 38(1), 86\u2013124 (1989)","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"9658_CR25","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1137\/0213003","volume":"13","author":"M. Dyer","year":"1984","unstructured":"Dyer, M.: Linear time algorithms for two- and three-variable linear programs. SIAM J. Comput. 13(1), 31\u201345 (1984)","journal-title":"SIAM J. Comput."},{"key":"9658_CR26","first-page":"488","volume-title":"Proc. of the 32nd Symposium on Foundations of Computer Science","author":"D. Eppstein","year":"1991","unstructured":"Eppstein, D.: Dynamic three-dimensional linear programming. In: Proc. of the 32nd Symposium on Foundations of Computer Science, pp. 488\u2013494 (1991)"},{"key":"9658_CR27","first-page":"442","volume-title":"Proc. of the 16th Annual European Symposium on Algorithms (ESA)","author":"H. Fournier","year":"2008","unstructured":"Fournier, H., Vigneron, A.: Fitting a step function to a point set. In: Proc. of the 16th Annual European Symposium on Algorithms (ESA), pp. 442\u2013453 (2008)"},{"issue":"1","key":"9658_CR28","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":"9658_CR29","first-page":"168","volume-title":"Proc. of the 2nd Annual ACM-SIAM Symposium of Discrete Algorithms (SODA)","author":"G.N. Frederickson","year":"1991","unstructured":"Frederickson, G.N.: Optimal algorithms for tree partitioning. In: Proc. of the 2nd Annual ACM-SIAM Symposium of Discrete Algorithms (SODA), pp. 168\u2013177 (1991)"},{"key":"9658_CR30","first-page":"135","volume-title":"Proc. of the 16th Annual ACM Symposium on Theory of Computing (STOC)","author":"H. Gabow","year":"1984","unstructured":"Gabow, H., Bentley, J., Tarjan, R.: Scaling and related techniques for geometry problems. In: Proc. of the 16th Annual ACM Symposium on Theory of Computing (STOC), pp. 135\u2013143 (1984)"},{"key":"9658_CR31","doi-asserted-by":"crossref","first-page":"322","DOI":"10.1145\/177424.178040","volume-title":"Proc. of the 10th Annual ACM Symposium on Computational Geometry","author":"M. Goodrich","year":"1994","unstructured":"Goodrich, M.: Efficient piecewise-linear function approximation using the uniform metric. In: Proc. of the 10th Annual ACM Symposium on Computational Geometry, pp. 322\u2013331 (1994)"},{"issue":"6","key":"9658_CR32","doi-asserted-by":"crossref","first-page":"1509","DOI":"10.1007\/s00778-007-0083-9","volume":"17","author":"S. Guha","year":"2008","unstructured":"Guha, S.: On the space\u2013time of optimal, approximate and streaming algorithms for synopsis construction problems. VLDB J. 17(6), 1509\u20131535 (2008)","journal-title":"VLDB J."},{"issue":"7","key":"9658_CR33","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."},{"key":"9658_CR34","first-page":"300","volume-title":"Proc. of the 30th International Conference on Very Large Data Bases (VLDB)","author":"S. Guha","year":"2004","unstructured":"Guha, S., Shim, K., Woo, J.: Rehist: relative error histogram construction algorithms. In: Proc. of the 30th International Conference on Very Large Data Bases (VLDB), pp. 300\u2013311 (2004)"},{"issue":"1","key":"9658_CR35","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1142\/S0218195991000025","volume":"1","author":"L. Guibas","year":"1991","unstructured":"Guibas, L., Hershberger, J., Snoeyink, J.: Compact interval trees: A data structure for convex hulls. Int. J. Comput. Geom. Appl. 1(1), 1\u201322 (1991)","journal-title":"Int. J. Comput. Geom. Appl."},{"key":"9658_CR36","first-page":"132","volume-title":"CVGIP: Graphical Models and Image Processing","author":"S. Hakimi","year":"1991","unstructured":"Hakimi, S., Schmeichel, E.: Fitting polygonal functions to a set of points in the plane. In: CVGIP: Graphical Models and Image Processing, vol. 53, pp. 132\u2013136 (1991)"},{"key":"9658_CR37","doi-asserted-by":"crossref","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 J. Comput. 13, 338\u2013355 (1984)","journal-title":"SIAM J. Comput."},{"key":"9658_CR38","first-page":"275","volume-title":"Proc. of the 24th International Conference on Very Large Data Bases (VLDB)","author":"H.V. Jagadish","year":"1998","unstructured":"Jagadish, H.V., Koudas, N., Muthukrishnan, S., Poosala, V., Sevcik, K.C., Suel, T.: Optimal histograms with quality guarantees. In: Proc. of the 24th International Conference on Very Large Data Bases (VLDB), pp. 275\u2013286 (1998)"},{"key":"9658_CR39","first-page":"380","volume-title":"Proc. of the 13th International Conference on Knowledge Discovery and Data Mining","author":"P. Karras","year":"2007","unstructured":"Karras, P., Sacharidis, D., Mamoulis, N.: Exploiting duality in summarization with deterministic guarantees. In: Proc. of the 13th International Conference on Knowledge Discovery and Data Mining, pp. 380\u2013389 (2007)"},{"key":"9658_CR40","first-page":"384","volume-title":"Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"S. Khanna","year":"1998","unstructured":"Khanna, S., Muthukrishnan, S., Paterson, M.: On approximating rectangle tiling and packing. In: Proc. of the 9th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 384\u2013393 (1998)"},{"issue":"1","key":"9658_CR41","doi-asserted-by":"crossref","first-page":"28","DOI":"10.1137\/0212002","volume":"12","author":"D. Kirkpatrick","year":"1983","unstructured":"Kirkpatrick, D.: Optimal search in planar subdivisions. SIAM J. Comput. 12(1), 28\u201335 (1983)","journal-title":"SIAM J. Comput."},{"key":"9658_CR42","doi-asserted-by":"crossref","first-page":"329","DOI":"10.1137\/0211025","volume":"11","author":"D. Lichtenstein","year":"1982","unstructured":"Lichtenstein, D.: Planar formulae and their uses. SIAM J. Comput. 11, 329\u2013343 (1982)","journal-title":"SIAM J. Comput."},{"issue":"1","key":"9658_CR43","doi-asserted-by":"crossref","first-page":"365","DOI":"10.1007\/BF02570713","volume":"14","author":"J. Matou\u0161ek","year":"1995","unstructured":"Matou\u0161ek, J.: On geometric optimization with few violated constraints. Discrete Comput. Geom. 14(1), 365\u2013384 (1995)","journal-title":"Discrete Comput. Geom."},{"key":"9658_CR44","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.: Approximating a set of points by a step function. J. Vis. Commun. Image Represent. 17, 1178\u20131189 (2006)","journal-title":"J. Vis. Commun. Image Represent."},{"key":"9658_CR45","doi-asserted-by":"crossref","first-page":"414","DOI":"10.1287\/moor.4.4.414","volume":"4","author":"N. Megiddo","year":"1979","unstructured":"Megiddo, N.: Combinatorial optimization with rational objective functions. Math. Oper. Res. 4, 414\u2013424 (1979)","journal-title":"Math. Oper. Res."},{"issue":"4","key":"9658_CR46","doi-asserted-by":"crossref","first-page":"852","DOI":"10.1145\/2157.322410","volume":"30","author":"N. Megiddo","year":"1983","unstructured":"Megiddo, N.: Applying parallel computation algorithms in the design of serial algorithms. J. ACM 30(4), 852\u2013865 (1983)","journal-title":"J. ACM"},{"issue":"1","key":"9658_CR47","doi-asserted-by":"crossref","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. J. ACM 31(1), 114\u2013127 (1984)","journal-title":"J. ACM"},{"key":"9658_CR48","doi-asserted-by":"crossref","first-page":"1675","DOI":"10.1137\/1.9781611973082.129","volume-title":"Proc. of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms","author":"G.L. Miller","year":"2011","unstructured":"Miller, G.L., Peng, R., Schwartz, R., Tsourakakis, C.E.: Approximate dynamic programming using halfspace queries and multiscale Monge decomposition. In: Proc. of the 22nd Annual ACM-SIAM Symposium on Discrete Algorithms, pp. 1675\u20131682 (2011)"},{"key":"9658_CR49","doi-asserted-by":"crossref","first-page":"95","DOI":"10.1016\/0925-7721(95)00006-U","volume":"5","author":"J.S.B. Mitchell","year":"1995","unstructured":"Mitchell, J.S.B., Suri, S.: Separation and approximation of polyhedral objects. Comput. Geom. Theory Appl. 5, 95\u2013114 (1995)","journal-title":"Comput. Geom. Theory Appl."},{"key":"9658_CR50","doi-asserted-by":"crossref","first-page":"217","DOI":"10.1016\/0304-3975(78)90051-8","volume":"7","author":"D. Muller","year":"1978","unstructured":"Muller, D., Preparata, F.P.: Finding the intersection of two convex polyhedra. Theor. Comput. Sci. 7, 217\u2013236 (1978)","journal-title":"Theor. Comput. Sci."},{"key":"9658_CR51","first-page":"236","volume-title":"Proc. of the 7th International Conference on Database Theory (ICDT)","author":"S. Muthukrishnan","year":"1999","unstructured":"Muthukrishnan, S., Poosala, V., Suel, T.: On rectangular partitionings in two dimensions: algorithms complexity, and applications. In: Proc. of the 7th International Conference on Database Theory (ICDT), pp. 236\u2013256 (1999)"},{"key":"9658_CR52","doi-asserted-by":"crossref","first-page":"574","DOI":"10.1145\/358746.358758","volume":"24","author":"J. O\u2019Rourke","year":"1981","unstructured":"O\u2019Rourke, J.: An on-line algorithm for fitting straight lines between data ranges. Commun. ACM 24, 574\u2013578 (1981)","journal-title":"Commun. ACM"},{"issue":"2","key":"9658_CR53","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1016\/0022-0000(81)90012-X","volume":"23","author":"M. Overmars","year":"1981","unstructured":"Overmars, M., van Leeuwen, J.: Maintenance of configurations in the plane. J. Comput. Syst. Sci. 23(2), 166\u2013204 (1981)","journal-title":"J. Comput. Syst. Sci."},{"issue":"2","key":"9658_CR54","doi-asserted-by":"crossref","first-page":"109","DOI":"10.1016\/0020-0190(94)00134-0","volume":"52","author":"T. Roos","year":"1994","unstructured":"Roos, T., Widmayer, P.: k-violation linear programming. Inf. Process. Lett. 52(2), 109\u2013114 (1994)","journal-title":"Inf. Process. Lett."},{"key":"9658_CR55","doi-asserted-by":"crossref","first-page":"1253","DOI":"10.1137\/0217079","volume":"17","author":"B. Schieber","year":"1988","unstructured":"Schieber, B., Vishkin, U.: On finding lowest common ancestors: simplification and parallelization. SIAM J. Comput. 17, 1253\u20131262 (1988)","journal-title":"SIAM J. Comput."},{"key":"9658_CR56","first-page":"786","volume-title":"Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA)","author":"A. Smith","year":"1999","unstructured":"Smith, A., Suri, S.: Rectangular tiling in multi-dimensional arrays. In: Proc. of the 10th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA), pp. 786\u2013794 (1999)"},{"key":"9658_CR57","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1145\/237218.237400","volume-title":"Proc. of the 12th Annual ACM Symposium on Computational Geometry","author":"K. Varadarajan","year":"1996","unstructured":"Varadarajan, K.: Approximating monotone polygonal curves using the uniform metric. In: Proc. of the 12th Annual ACM Symposium on Computational Geometry, pp. 311\u2013318 (1996)"},{"issue":"1","key":"9658_CR58","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), 329\u2013334 (2002)","journal-title":"Pattern Recognit. Lett."},{"key":"9658_CR59","doi-asserted-by":"crossref","first-page":"515","DOI":"10.1007\/3-540-57568-5_283","volume-title":"Proc. of the 4th International Symposium on Algorithms and Computation (ISAAC)","author":"D. Wang","year":"1993","unstructured":"Wang, D., Huang, N., Chao, H., Lee, R.: Plane sweep algorithms for the polynomial approximation problems with applications. In: Proc. of the 4th International Symposium on Algorithms and Computation (ISAAC), pp. 515\u2013522 (1993)"}],"container-title":["Algorithmica"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9658-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s00453-012-9658-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s00453-012-9658-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,22]],"date-time":"2023-06-22T20:24:10Z","timestamp":1687465450000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s00453-012-9658-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,5,18]]},"references-count":59,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2013,7]]}},"alternative-id":["9658"],"URL":"https:\/\/doi.org\/10.1007\/s00453-012-9658-y","relation":{},"ISSN":["0178-4617","1432-0541"],"issn-type":[{"value":"0178-4617","type":"print"},{"value":"1432-0541","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,5,18]]}}}