Fitting rectilinear polgonal curves to a set of points in the plane.

DOI10.1016/S0377-2217(00)00023-0zbMath1068.65034OpenAlexW2013640586MaRDI QIDQ5932036

Juan A. Mesa, José-Miguel Díaz-Báñez

Publication date: 2001

Published in: European Journal of Operational Research (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/s0377-2217(00)00023-0

zbMATH Keywords

Computational geometryFacility locationOptimizationPolygonal approximation

Mathematics Subject Classification ID

Numerical aspects of computer graphics, image analysis, and computational geometry (65D18)

Related Items

Approximating points by a piecewise linear function ⋮ A RANDOMIZED ALGORITHM FOR WEIGHTED APPROXIMATION OF POINTS BY A STEP FUNCTION ⋮ FITTING A STEP FUNCTION TO A POINT SET WITH OUTLIERS BASED ON SIMPLICIAL THICKNESS DATA STRUCTURES ⋮ Linear-time fitting of a \(k\)-step function ⋮ Mathematics and flamenco: an unexpected partnership ⋮ Fitting a two-joint orthogonal chain to a point set ⋮ Continuous location of dimensional structures. ⋮ Fitting a Step Function to a Point Set ⋮ Outlier respecting points approximation ⋮ The location of median paths on grid graphs ⋮ Computing melodic templates in oral music traditions ⋮ Fitting a step function to a point set ⋮ Linear-Time Fitting of a k-Step Function ⋮ Weighted Rectilinear Approximation of Points in the Plane

Cites Work

• Algorithms for unconstrained \(L_ 1\) simple linear regression
• Location of rectilinear center trajectories
• Polygonal approximation by the minimax method
• Applying Parallel Computation Algorithms in the Design of Serial Algorithms
• Fitting polygonal functions to a set of points in the plane
• APPROXIMATION OF POLYGONAL CURVES WITH MINIMUM NUMBER OF LINE SEGMENTS OR MINIMUM ERROR
• Unnamed Item
• Unnamed Item