TY - JOUR
T1 - Polyline fitting of planar points under min-sum criteria
AU - Aronov, Boris
AU - Asano, Tetsuo
AU - Katoh, Naoki
AU - Mehlhorn, Kurt
AU - Tokuyama, Takeshi
N1 - Funding Information:
★Work of B.A. on this paper was supported in part by NSF ITR Grant CCR-00-81964. Part of the work was carried out while B.A. was visiting JAIST. ★★ Work of T.A. was partially supported by the Ministry of Education, Science, Sports and Culture, Grant-in-Aid for Scientific Research (B).
PY - 2004
Y1 - 2004
N2 - Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k joints under the min-sum criteria with respect to L 1- and L2metrics, which are more appropriate measures than uniform and Hausdorff metrics in statistical context. We present efficient algorithms for the 1-joint versions of the problem, and fully polynomial-time approximation schemes for the general k-joint versions.
AB - Fitting a curve of a certain type to a given set of points in the plane is a basic problem in statistics and has numerous applications. We consider fitting a polyline with k joints under the min-sum criteria with respect to L 1- and L2metrics, which are more appropriate measures than uniform and Hausdorff metrics in statistical context. We present efficient algorithms for the 1-joint versions of the problem, and fully polynomial-time approximation schemes for the general k-joint versions.
UR - http://www.scopus.com/inward/record.url?scp=33746197717&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=33746197717&partnerID=8YFLogxK
U2 - 10.1007/978-3-540-30551-4_9
DO - 10.1007/978-3-540-30551-4_9
M3 - Article
AN - SCOPUS:33746197717
VL - 3341
SP - 77
EP - 88
JO - Lecture Notes in Computer Science
JF - Lecture Notes in Computer Science
SN - 0302-9743
ER -