Presentation 2005-01-28
Algorithms and Implementation of Peak-Reducing Fitting of a Curve
Masato YUKI, Jinhee CHUN, Kunihiko SADAKANE, Takeshi TOKUYAMA,
PDF Download Page PDF download Page Link
Abstract(in Japanese) (See Japanese page)
Abstract(in English) The problem of approximating complexity curve is basic operation for processing of geometry data. In this paper, We emphasize characteristic of output curve. We consider k-peaked curve φ that the distance between f and φ is minimized. We design algorithms for computing φ for L_∞-distance and L_1-distance.
Keyword(in Japanese) (See Japanese page)
Keyword(in English) curve approximation / peak-reduction / L_p-distance / unimodal approximation / algorithms
Paper # COMP2004-70
Date of Issue

Conference Information
Committee COMP
Conference Date 2005/1/21(1days)
Place (in Japanese) (See Japanese page)
Place (in English)
Topics (in Japanese) (See Japanese page)
Topics (in English)
Chair
Vice Chair
Secretary
Assistant

Paper Information
Registration To Theoretical Foundations of Computing (COMP)
Language JPN
Title (in Japanese) (See Japanese page)
Sub Title (in Japanese) (See Japanese page)
Title (in English) Algorithms and Implementation of Peak-Reducing Fitting of a Curve
Sub Title (in English)
Keyword(1) curve approximation
Keyword(2) peak-reduction
Keyword(3) L_p-distance
Keyword(4) unimodal approximation
Keyword(5) algorithms
1st Author's Name Masato YUKI
1st Author's Affiliation Graduate School of Information Sciences, Tohoku University()
2nd Author's Name Jinhee CHUN
2nd Author's Affiliation Graduate School of Information Sciences, Tohoku University
3rd Author's Name Kunihiko SADAKANE
3rd Author's Affiliation Department of Computer Science and Communication Engineering, Kyushu University
4th Author's Name Takeshi TOKUYAMA
4th Author's Affiliation Graduate School of Information Sciences, Tohoku University
Date 2005-01-28
Paper # COMP2004-70
Volume (vol) vol.104
Number (no) 642
Page pp.pp.-
#Pages 7
Date of Issue