POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA

DOI10.1142/S0218195906001951zbMath1098.65011MaRDI QIDQ5470166

Takeshi Tokuyama, Kurt Mehlhorn, Naoki Katoh, Tetsuo Asano, Boris Aronov

Publication date: 29 May 2006

Published in: International Journal of Computational Geometry & Applications (Search for Journal in Brave)

zbMATH Keywords

algorithmsregression analysiscomputational geometrypolynomial time approximation schemeparametric searchingpolyline fitting

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) General nonlinear regression (62J02) Computer-aided design (modeling of curves and surfaces) (65D17)

Related Items (4)

Fitting a two-joint orthogonal chain to a point set ⋮ Adaptively refined dynamic program for linear spline regression ⋮ Fluctuated Fitting Under the $$\ell _1$$ -metric ⋮ Weighted Rectilinear Approximation of Points in the Plane

Cites Work

• A linear-time algorithm for linear \(L_ 1\) approximation of points
• Efficient partition trees
• Finding a minimum-weight \(k\)-link path in graphs with the concave Monge property and applications
• On levels in arrangements of lines, segments, planes, and triangles
• A fast Las Vegas algorithm for triangulating a simple polygon
• Efficient piecewise-linear function approximation using the uniform metric
• Ray Shooting and Parametric Search
• Polygonal approximation by the minimax method
• Finding Least-Distances Lines
• Fitting polygonal functions to a set of points in the plane

This page was built for publication: POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA