An optimal way of moving a sequence of points onto a curve in two dimensions

DOI10.1023/A:1008617208706zbMATH Open1038.65510OpenAlexW1589041335MaRDI QIDQ1294823FDOQ1294823

Authors M. J. D. Powell 

Publication date 1999

Published in Computational Optimization and Applications (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1023/a:1008617208706

zbMATH Keywords

curve fittingimage registrationminimax appropriationsequence constraints

Mathematics Subject Classification ID

Numerical smoothing, curve fitting (65D10) Nonlinear programming (90C30) Computing methodologies for image processing (68U10) Approximation with constraints (41A29)

Recommendations

• scientific article; zbMATH DE number 3938424
• scientific article; zbMATH DE number 19421
• A new algorithm for fitting a rectilinear \(x\)-monotone curve to a set of points in the plane
• scientific article; zbMATH DE number 19408

Cited In (3)

• OPTIMAL ADAPTIVE ALGORITHMS FOR FINDING THE NEAREST AND FARTHEST POINT ON A PARAMETRIC BLACK-BOX CURVE
• Rearranging a sequence of points onto a line
• Optimal adaptive algorithms for finding the nearest and farthest point on a parametric black-box curve

This page was built for publication: An optimal way of moving a sequence of points onto a curve in two dimensions

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1294823)