Because the administrators recomend to post the topics from classical geometry here, there's one covering problem, that I've tried to generalized (still without success) one simpler task:(adsbygoogle = window.adsbygoogle || []).push({});

How to cover the plane by cyclic tetragons T_1, T_2,... (a tetragon is called cyclic if it's possible to circumscribe it a circle) that resemble to the given cyclic tetragon T, so that for each i<>j tegragons T_i and T_j are similar, but they don't coincide.

note: easier problem is to cover the plane by similar rectangulars....

I don't know how to start, e.g. if T isn't a rectangle we can find tetragons T_i and T_j that form an isosceles trapezoid and then it suffices to cover the plane by similar isosceles trapezoids... but this is too litle to solve the problem. Can anybody help? Thanks...

**Physics Forums - The Fusion of Science and Community**

Dismiss Notice

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# A covering problem

Can you offer guidance or do you also need help?

Draft saved
Draft deleted

Loading...

Similar Threads for covering problem | Date |
---|---|

A Maximization problem using Euler Lagrange | Feb 2, 2018 |

Open cover for this set | Mar 9, 2011 |

Open Cover | Mar 9, 2011 |

Could you help me better understand covers, open covers, subcovers ? | Nov 20, 2010 |

Open coverings and Heine-Borel theorem | Sep 17, 2009 |

**Physics Forums - The Fusion of Science and Community**