An Exposition of Polygonal Approximation of Circle

08 August 2022, Version 2
This content is an early or alternative research output and has not been peer-reviewed by Cambridge University Press at the time of posting.

Abstract

This article attempts to discuss a journey of creating an infinite number of circles from a single circle, using its tangents with a pattern ( PX; X≥3 ) and reaching uptoasingle point fromagivencircle. The time to get a newcirclefromits predecessor circle varies with the pattern. The pattern behind both the radius of the successor circles and predecessor circles is also discussed. Most interestingly, when we apply the P∞ pattern, then all the infinitely many successor circles almost merge into a single one, almost without taking any time and it takes infinite time to reach up to a single point from the given circle, for that pattern. This whole idea can be applied to astronomical objects. Although we are dealing with a circular path, which is an approximation for the elliptical orbit of a celestial body.

Keywords

Circle generation
n-Regular polygons
Approximations
Orbits

Comments

Comments are not moderated before they are posted, but they can be removed by the site moderators if they are found to be in contravention of our Commenting and Discussion Policy [opens in a new tab] - please read this policy before you post. Comments should be used for scholarly discussion of the content in question. You can find more information about how to use the commenting feature here [opens in a new tab] .
This site is protected by reCAPTCHA and the Google Privacy Policy [opens in a new tab] and Terms of Service [opens in a new tab] apply.