Jump to content
  • Advertisement
Sign in to follow this  
Telamon

Space Partition Puzzle

This topic is 3743 days old which is more than the 365 day threshold we allow for new replies. Please post a new topic.

If you intended to correct an error in the post then please contact us.

Recommended Posts

Q: What is the maximal number of polytopes generated by the intersection of three cubes. (more specifically, I mean 3-polytopes or "cells") I'm usually pretty good at visualizing this stuff, but 3 cubes creates too many cells to keep track of. Is there a way to solve this problem in a general way - rather than just counting? Reminds me a bit of the zone theorem for line arrangements, but I don't know how to account for the cube constraints. This might sound like a homework problem - it's not; I've earned my degree. I took CS384 - Computational Geometry, and it's something of a brainworm.

Share this post


Link to post
Share on other sites
Advertisement
3-polytopes? I'm guessing you mean polyhedrons.

What exactly do you mean with "number of polytopes"? Do you mean number of faces (polygons) to build a polyhedron? i.e. for one cube: 6. Or do you mean number of polyhedrons? i.e. a cube is one polyhedron.

What about the shape of the polyhedrons? (Convex or concave?)
If concave... goodluck! I wouldn't have a clue. Well... perhaps then you could then split the concave polyhedron in to multiple convex polyhedrons and reason with that.

Share this post


Link to post
Share on other sites
If I understand the problem correctly, the answer is 7. But perhaps you should explain your question better.

Share this post


Link to post
Share on other sites
Sign in to follow this  

  • Advertisement
×

Important Information

By using GameDev.net, you agree to our community Guidelines, Terms of Use, and Privacy Policy.

We are the game development community.

Whether you are an indie, hobbyist, AAA developer, or just trying to learn, GameDev.net is the place for you to learn, share, and connect with the games industry. Learn more About Us or sign up!

Sign me up!