Skip to main content
Log in

Chebyshev approximation to data by geometric elements

  • Published:
Numerical Algorithms Aims and scope Submit manuscript

Abstract

An algorithm is presented and proved correct, for the efficient approximation of finite point sets in ℝ2 and ℝ3 by geometric elements such as circles, spheres and cylinders. It is shown that the approximation criterion used, viz. minimising the maximum orthogonal deviation, is best modelled mathematically through the concept of aparallel body. This notion, besides being a valuable tool for form assessment in metrology, contributes to approximation theory by introducing a new kind of approximation, here called “geometric” or “orthogonal”. This approach is closely related to but different from Chebyshev approximation.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Similar content being viewed by others

Reference

  1. See, e.g., F.A. Valentine,Convex Sets (McGraw-Hill, New York, 1964).

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Additional information

The work described is part of a Commission of the European Communities project (Contract 3327/1/0/158/89/9-BCR-UK(30)).

Rights and permissions

Reprints and permissions

About this article

Cite this article

Drieschner, R. Chebyshev approximation to data by geometric elements. Numer Algor 5, 509–522 (1993). https://doi.org/10.1007/BF02108666

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF02108666

Keywords

Navigation