Area of a circle each polygon side is a radius, of length "r". And since the total side length is greater than the circumference, the polygon consists of "n" identical triangles with total area greater than "T". Again we have a contradiction, so our supposition that "C" might be less than "T" must be wrong as well. Therefore, it must be the case that the area enclosed by the circle is precisely the same as the area of the triangle. This concludes the proof. Following Satō Moshun and Leonardo da Vinci , we can use inscribed regular polygons in a different way. Suppose we
Planar straight-line graph Planar straight-line graph In computational geometry, a planar straight-line graph, in short "PSLG", (or "straight-line plane graph", or "plane straight-line graph") is a term used for an embedding of a planar graph in the plane such that its edges are mapped into straight line segments. Fáry's theorem (1948) states that every planar graph has this kind of embedding. In computational geometry, PSLGs have often been called planar subdivisions, with an assumption or assertion that subdivisions are polygonal. A PSLG without vertices of degree 1 defines a subdivision of the plane into polygonal regions and vice versa. The absence of vertices