All about flooble | fun stuff | Get a free chatterbox | Free JavaScript | Avatars    
perplexus dot info

Home > Shapes
Cutting planes with polygons (Posted on 2006-09-06) Difficulty: 3 of 5
Into how many regions can you partition the plane with m n-sided regular polygons?

For example, with two squares you can achieve up to 10 regions by choosing the right size and position of your squares.

See The Solution Submitted by JLo    
Rating: 4.0000 (2 votes)

Comments: ( Back to comment list | You must be logged in to post comments.)
Solution - last paragraph - and irregular polygons | Comment 15 of 17 |
This problem stated regular polygons and that is how we have addressed it.

I believe that we can still get the same result with m n-sided irregular polygons, provided that:
1. The exterior angle at each vertex is greater than 180º
2. The vertices of each newly overlaid polygon are similarly displaced (ie anti/clockwise) from its 'neighbour'.
and
3. All vertices each have a vertex in common with an m*n 'virtual' polygon which forms the 'circumference' of the m polygonal array.  The only restriction on the vertex angles of this polygon is that it forms a 'perimeter'; its sides do not cross any other lines.

With all of that in mind, the polygons don't need to have a shared point of rotation as was used in the way that we have approached the problem; actually, this scenario can be applied to the regular case.

Yes?



  Posted by brianjn on 2006-09-21 02:15:13
Please log in:
Login:
Password:
Remember me:
Sign up! | Forgot password


Search:
Search body:
Forums (0)
Newest Problems
Random Problem
FAQ | About This Site
Site Statistics
New Comments (5)
Unsolved Problems
Top Rated Problems
This month's top
Most Commented On

Chatterbox:
Copyright © 2002 - 2024 by Animus Pactum Consulting. All rights reserved. Privacy Information