Timeline for How to break a concave polyhedron into a few convex polyhedron?
Current License: CC BY-SA 2.5
8 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Oct 10, 2010 at 20:52 | comment | added | Yemon Choi | It may be a nice problem, but I still wish the original post had communicated more than "here's something I don't know, let me know when you guys have the answer" | |
| Oct 10, 2010 at 16:55 | history | edited | Kevin O'Bryant | CC BY-SA 2.5 |
spelling, deleted "thanks in advance!!"
|
| Oct 10, 2010 at 16:55 | comment | added | Kevin O'Bryant | Just the fact that it can be broken down (triangulated) is not as obvious as it seems at first glance. This seems to me to be roughly equivalent to the Jordan curve theorem, so I'd beware any answer that is both simple and doesn't use Jordan's result. And then there's that pesky adjective you used: "few". Nice problem. | |
| Oct 10, 2010 at 14:55 | answer | added | Joseph O'Rourke | timeline score: 11 | |
| Oct 10, 2010 at 6:25 | answer | added | Fedor Petrov | timeline score: 6 | |
| Oct 10, 2010 at 4:34 | comment | added | sleepless in beantown | What have you tried so far to attack this problem? Have you tried to break down a concave polygon into its component convex polygons? How are you specifying the polyhedron... | |
| Oct 10, 2010 at 4:24 | comment | added | Yemon Choi | In certain cases yes, In general, I don't know. Could you please provide some evidence/illustration that you've thought about this, and some indication of why you want to know? Otherwise the way you phrase the question makes it sound like idle curiosity | |
| Oct 10, 2010 at 3:59 | history | asked | user9868 | CC BY-SA 2.5 |