Timeline for Count points enclosed by several planes in 3D space
Current License: CC BY-SA 3.0
16 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 20, 2014 at 20:43 | vote | accept | Danimar Ribeiro | ||
| Sep 19, 2014 at 14:32 | answer | added | A.Schulz | timeline score: 2 | |
| Sep 19, 2014 at 13:59 | answer | added | Luis Colorado | timeline score: 2 | |
| Sep 18, 2014 at 21:42 | comment | added | D.W.♦ | Please don't cross-post the same question on multiple SE sites. In the future, if you've posted it on the wrong site, you can click flag to flag it for moderator attention and ask them to migrate it. | |
| Sep 18, 2014 at 16:41 | comment | added | Danimar Ribeiro | Maybe is this applied to 3D? en.wikipedia.org/wiki/Integer_points_in_convex_polyhedra | |
| Sep 18, 2014 at 14:05 | comment | added | Abhishek Bansal | @Raphael Yes, Polytope is right. Also, as I mentioned, my suggestion was for the benefit of OP as I felt a better response may be got on math.stackexchange. | |
| Sep 18, 2014 at 14:01 | comment | added | Raphael | @user1990169 Polytope would be the word to use, wouldn't it? (Note that since the question asks for an algorithmic solution it is perfectly ontopic here.) | |
| Sep 18, 2014 at 14:00 | comment | added | Raphael | Maybe convex-hull algorithms can help? | |
| Sep 18, 2014 at 13:59 | history | edited | Raphael | CC BY-SA 3.0 |
deleted 97 characters in body
|
| Sep 18, 2014 at 13:48 | comment | added | Danimar Ribeiro | I'll check about the inequalities, despite I'm studying physics I'm still not confortable with some math problems. I posted there math.stackexchange.com/questions/936502/… | |
| Sep 18, 2014 at 13:23 | comment | added | Abhishek Bansal | It will be easier if you visualise the problem in 2-D. Say you have 10 lines randomly placed and oriented in space. Then those lines shall form polygons (some closed, some open). Each polygon shall be defined by a set of in-equalities. Then pick up each point and check which set of inequalities that point satisfies. I suggested you to post this on math.stackexchange because IMO you have a better chance of getting good answers for this question there. | |
| Sep 18, 2014 at 13:18 | comment | added | Danimar Ribeiro | Could you elaborate more on that? I'm not seeing how this inequalities would help me. I thought this would be the best place since this question was proposed in the last programming contest here in Brazil, so I supposed it would have an algorithm for this. | |
| Sep 18, 2014 at 13:07 | comment | added | Abhishek Bansal | You will first have to identify your regions by changing the plane equations to inequalities. Then for each point just check which set of inequalities it satisfies. Also, this question is more suitable for math.stackexchange.com | |
| Sep 18, 2014 at 13:06 | history | edited | FrankW | CC BY-SA 3.0 |
added 1 character in body; edited tags
|
| Sep 18, 2014 at 13:03 | review | First posts | |||
| Sep 18, 2014 at 13:06 | |||||
| Sep 18, 2014 at 13:01 | history | asked | Danimar Ribeiro | CC BY-SA 3.0 |