Fitting polygonal functions to a set of points in the plane

DOI10.1016/1049-9652(91)90056-PzbMath0808.68107OpenAlexW1983699268MaRDI QIDQ4303746

S. Louis Hakimi, Edward F. Schmeichel

Publication date: 9 March 1995

Published in: CVGIP: Graphical Models and Image Processing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/1049-9652(91)90056-p

zbMATH Keywords

linear time algorithmcomputational geometry

Mathematics Subject Classification ID

Computer graphics; computational geometry (digital and algorithmic aspects) (68U05)

Related Items (17)

Risk measure preserving piecewise linear approximation of empirical distributions ⋮ Approximating points by a piecewise linear function ⋮ Single equation without inequalities to represent a composite curve ⋮ Efficient piecewise-linear function approximation using the uniform metric ⋮ Convex piecewise-linear fitting ⋮ Fitting a two-joint orthogonal chain to a point set ⋮ A unified framework for bivariate clustering and regression problems via mixed-integer linear programming ⋮ Efficient observer-dependent simplification in polygonal domains ⋮ Continuous location of dimensional structures. ⋮ Optimal simplification of polygonal chains for subpixel-accurate rendering ⋮ Fitting rectilinear polgonal curves to a set of points in the plane. ⋮ Polygonal chain approximation: A query based approach ⋮ Weighted Rectilinear Approximation of Points in the Plane ⋮ POLYLINE FITTING OF PLANAR POINTS UNDER MIN-SUM CRITERIA ⋮ Streaming algorithms for line simplification ⋮ Polygonal path simplification with angle constraints ⋮ Efficient algorithms for 3-D polygonal approximation based on LISE criterion

This page was built for publication: Fitting polygonal functions to a set of points in the plane