A planar minimax algorithm for analysis of coordinate measurements

DOI10.1007/BF02521605zbMath0830.65056MaRDI QIDQ1895919

D. Zwick

Publication date: 4 February 1996

Published in: Advances in Computational Mathematics (Search for Journal in Brave)

zbMATH Keywords

nonlinear minimax approximationsmallest enclosing circlecoordinate measurement quality control

Mathematics Subject Classification ID

Numerical mathematical programming methods (65K05) Quadratic programming (90C20)

Related Items

An algorithm for matching point sets using the \(l_1\) norm

Uses Software

• Matlab
• BRENT

Cites Work

• On the Complexity of the Elzinga-Hearn Algorithm for the 1-Center Problem
• Analysis of Measurements Based on the Singular Value Decomposition
• Efficient Algorithms for the (Weighted) Minimum Circle Problem
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item