I was playing around a little with approximating $\pi$ by calculating the perimeter of a regular polygon both inscribing and circumscribing a circle.
When using trigonometry then it can be shown that $\pi$ can be approximated using the perimeters of these polygons with $n$ sides as follows
$$ \pi_i(n) = n\,\sin\left(\frac{180^\circ}{n}\right), $$
$$ \pi_c(n) = n\,\tan\left(\frac{180^\circ}{n}\right), $$
with $\pi_i(n)$ and $\pi_c(n)$ the approximation of $\pi$ from an inscribing and circumscribing polygon respectively.
But $\pi_i(n)$ and $\pi_c(n)$ are always a lower and upper bound respectively for $\pi$. Therefore I thought that taking the average should give a better result, which indeed reduced the error. However the rate at which the error gets smaller as $n$ increases was the same as the previous two. When I started using different weights I found the following expression gives the best result
$$ \pi_w(n) = \frac23\,\pi_i(n) + \frac13\,\pi_c(n). $$
Graphing the errors of these approximations gives:
The rate at which the error of $\pi_i(n)$ and $\pi_c(n)$ goes down seems to be proportional to $n^{-2}$, while the rate at which the error of $\pi_w(n)$ goes down seems to be proportional to $n^{-4}$.
These converges rates can be explained by looking at the Taylor series of each expression. However I am curious if this could also be explained with pure geometry.