Misplaced Pages

Curve-fitting compaction

Article snapshot taken from Wikipedia with creative commons attribution-sharealike license. Give it a read and then ask your questions in the chat. We can research this topic together.
This article has multiple issues. Please help improve it or discuss these issues on the talk page. (Learn how and when to remove these messages)
This article includes a list of references, related reading, or external links, but its sources remain unclear because it lacks inline citations. Please help improve this article by introducing more precise citations. (January 2013) (Learn how and when to remove this message)
This article relies largely or entirely on a single source. Relevant discussion may be found on the talk page. Please help improve this article by introducing citations to additional sources.
Find sources: "Curve-fitting compaction" – news · newspapers · books · scholar · JSTOR (June 2024)
(Learn how and when to remove this message)

Curve-fitting compaction is data compaction accomplished by replacing data to be stored or transmitted with an analytical expression.

Examples of curve-fitting compaction consisting of discretization and then interpolation are:

  • Breaking of a continuous curve into a series of straight line segments and specifying the slope, intercept, and range for each segment
  • Using a mathematical expression, such as a polynomial or a trigonometric function, and a single point on the corresponding curve instead of storing or transmitting the entire graphic curve or a series of points on it.

References

Public Domain This article incorporates public domain material from Federal Standard 1037C. General Services Administration. Archived from the original on 2022-01-22.


Stub icon

This computing article is a stub. You can help Misplaced Pages by expanding it.

Categories: