Approximation by circles

DOI10.1007/BF02253130zbMath0412.41012OpenAlexW129553417MaRDI QIDQ5906226

T. J. Rivlin

Publication date: 1979

Published in: Computing (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/bf02253130

zbMATH Keywords

best uniform approximationmultidimensional problemsapproximation by circlesnonlinear approximation problembest annular approximationextremal signatures

Mathematics Subject Classification ID

Best approximation, Chebyshev systems (41A50) Multidimensional problems (41A63) Approximation by other special function classes (41A30)

Related Items (12)

COMPUTING ROUNDNESS IS EASY IF THE SET IS ALMOST ROUND ⋮ Culling a Set of Points for Roundness or Cylindricity Evaluations ⋮ THE LARGEST EMPTY ANNULUS PROBLEM ⋮ Global properties of pseudospectral methods ⋮ Locating a minisum annulus: a new partial coverage distance model ⋮ Computing constrained minimum-width annuli of point sets ⋮ Continuous location of dimensional structures. ⋮ Monte Carlo maximum likelihood circle fitting using circular density functions ⋮ Measure of circularity for parts of digital boundaries and its fast computation ⋮ Certified efficient global roundness evaluation ⋮ Structural tolerance and Delaunay triangulation ⋮ ON THE WIDTH AND ROUNDNESS OF A SET OF POINTS IN THE PLANE

Cites Work

• A Unified Approach to Certain Problems of Approximation and Minimization
• Unnamed Item

This page was built for publication: Approximation by circles