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.)
re: Solution - last paragraph - and irregular polygons | Comment 16 of 17 |
(In reply to Solution - last paragraph - and irregular polygons by brianjn)

Yes, looks like the configuration you describe generates the same number of edge intersections and thus (by Euler) the same number of regions. Maybe I would add a fourth condition to make sure no three edges intersect in one single point, which would waste a region. But that can be easily achieved by slightly nudging the polygons.

BTW, if we pose the more general problem of convex n-sided polygons (your first condition only), no more than the n*m*(m-1)+2 regions (for the regular case) are possible. Again this follows from Euler and from the fact that no polygon edge can intersect more than two other edges of another polygon, altogether giving no more than n*m*(m-1) intersection points.

  Posted by JLo on 2006-09-21 13:16:23

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 (8)
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