POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA-Reference-Cited by-同舟云学术

POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA

Published:2006-06 Issue:02n03 Volume:16 Page:97-116
ISSN:0218-1959
Container-title:International Journal of Computational Geometry & Applications
language:en
Short-container-title:Int. J. Comput. Geom. Appl.

Author:

ARONOV BORIS¹,ASANO TETSUO²,KATOH NAOKI³,MEHLHORN KURT⁴,TOKUYAMA TAKESHI⁵

Affiliation:

1. Department of Computer and Information Science, Polytechnic University, Brooklyn, NY 11201, USA

2. School of Information Science, Japan Advanced Institute of Science and Technology, Nomi, 923-1292, Japan

3. Faculty of Engineering, Department of Architecture and Architectural Systems, Kyoto University, Kyoto, 615-8540, Japan

4. Max-Planck-Institut für Informatik, D-66123, Saarbrücken, Germany

5. Graduate School of Information Sciences, Tohoku University, Sendai, 980-8579, Japan

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 L1- and L2-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.

Publisher

World Scientific Pub Co Pte Lt

Subject

Applied Mathematics,Computational Mathematics,Computational Theory and Mathematics,Geometry and Topology,Theoretical Computer Science

Link

https://www.worldscientific.com/doi/pdf/10.1142/S0218195906001951

Reference20 articles.

1. Finding a minimum-weightk-link path in graphs with the concave Monge property and applications

2. On Levels in Arrangements of Lines, Segments, Planes, and Triangles%

3. Ray Shooting and Parametric Search

4. Efficient Algorithms for Approximating Polygonal Chains

5. Algorithms in Combinatorial Geometry

Cited by 9 articles. 订阅此论文施引文献订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献

1. Univariate Continuous Piecewise Linear Regression;Encyclopedia of Optimization;2022-09-21

2. Efficiently Searching In-Memory Sorted Arrays;Proceedings of the 2019 International Conference on Management of Data;2019-06-25

3. Fluctuated Fitting Under the $$\ell _1$$ -metric;Frontiers in Algorithmics;2017

4. Adaptively refined dynamic program for linear spline regression;Computational Optimization and Applications;2014-03-25

5. Fitting a two-joint orthogonal chain to a point set;Computational Geometry;2011-04