JAIST Repository >
School of Information Science >
Articles >
Journal Articles >

Please use this identifier to cite or link to this item: http://hdl.handle.net/10119/4918

Title: Polyline Fitting of Planar Points Under Min-sum Criteria
Authors: Aronov, Boris
Asano, Tetsuo
Katoh, Naoki
Mehlhorn, Kurt
Tokuyama, Takeshi
Issue Date: 2005
Publisher: Springer
Magazine name: Lecture Notes in Computer Science
Volume: 3341
Start page: 77
End page: 88
Abstract: 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 L_2-metrics, 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.
Rights: This is the author-created version of Springer, Boris Aronov, Tetsuo Asano, Naoki Katoh, Kurt Mehlhorn and Takeshi Tokuyama , Lecture Notes in Computer Science, 3341, 2005, 77-88. The original publication is available at www.springerlink.com,
URI: http://hdl.handle.net/10119/4918
Material Type: author
Appears in Collections:b10-1. 雑誌掲載論文 (Journal Articles)

Files in This Item:

File Description SizeFormat
C4240.pdf218KbAdobe PDFView/Open

All items in DSpace are protected by copyright, with all rights reserved.


Contact : Library Information Section, Japan Advanced Institute of Science and Technology