Suppose we have a convex polygon P_0 with n given vertices, and we want to "nest" polygons P_j for j>0 by taking the midpoints between edges of P_{j-1} as the vertices. For a regular polygon the total area of all the polygons will form a geometric series that is pretty easy to solve for (at least in terms of trig functions) in terms of the area A of the original polygon P_0. However, what if P_0 is not regular? If we know the area of P_0, is there a formula for the sum of areas of all the nested polygons, in terms of n and the original area? Or do we need more information, like the vertices of P_0? If we need to know the vertices, are there formulas in terms of the vertices at least for some small values of n, like n=3,4?
Kailyn Hamilton
Answered question
2022-11-03
Total area for a natural nested set of convex polygons. Suppose we have a convex polygon with n given vertices, and we want to "nest" polygons for by taking the midpoints between edges of as the vertices. For a regular polygon the total area of all the polygons will form a geometric series that is pretty easy to solve for (at least in terms of trig functions) in terms of the area A of the original polygon . However, what if is not regular? If we know the area of , is there a formula for the sum of areas of all the nested polygons, in terms of n and the original area? Or do we need more information, like the vertices of ? If we need to know the vertices, are there formulas in terms of the vertices at least for some small values of n, like ?
Answer & Explanation
brulotfao
Beginner2022-11-04Added 16 answers
Step 1 Let the vertices of the polygon be in counterclockwise order, and for convenience define and so on. Then the (signed) area of the polygon is given by where . Note that . The nested polygon has vertices , and so its area is
Step 2 The area of the nested polygon is times the area of the original polygon, and plus times the total "area" of the polygon(s) obtained by connecting each vertex to the next-to-next one. Geometrically, connecting vertices by twos gives two cases. When n is even, you get two polygons and . When n is odd, you get a single "doubly-wrapped" polygon , such as a pentagram. In this case, the formula double-counts the area of the central region, which is why I've put "area" in quotes above. For small n, life is pretty simple, though: When , the polygon is just the same triangle with its vertices connected in backwards order, so it has the opposite (clockwise) orientation and negative signed area. Then you get . When , the "polygons" and are the diagonals of the quadrilateral and have zero area. So . In both these cases, the areas of the sequence of nested polygons form a geometric series no matter whether the original polygon was regular or not, and so you can easily compute the total area of the entire series. When , it turns out that the area of the alternating polygon(s) also depends on the arrangement of the vertices, not just the area of the original polygon. So one cannot determine A′ from A alone.