Algorithm for circle approximation and generation (Q1803695): Difference between revisions
From MaRDI portal
Changed an Item |
Set profile property. |
||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Revision as of 04:44, 5 March 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Algorithm for circle approximation and generation |
scientific article |
Statements
Algorithm for circle approximation and generation (English)
0 references
29 June 1993
0 references
The circle is approximated by a polygon in such a way that the area between the two curves is minimal. The best approximation is given by the polygon inscribed into a circle with a slightly enlarged radius which can be easily calculated. This is also the polygon which has least distance from the circle.
0 references
circle approximation
0 references
best approximation
0 references
polygon
0 references
