Timeline for Finding a bounding volume (line segments) from a kDop definition.
Current License: CC BY-SA 2.5
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Jul 1, 2014 at 19:25 | answer | added | user54555 | timeline score: 1 | |
| Jul 7, 2013 at 5:12 | comment | added | tanglei | For the question, it's difficult to manage the relationship between the intersection planes.I cannot find a better way. @feal87 Have u solved this problem. I am also want to draw kdop.. Hope u can help me | |
| Feb 1, 2010 at 20:24 | vote | accept | feal87 | ||
| Feb 1, 2010 at 20:14 | answer | added | fedja | timeline score: 4 | |
| Feb 1, 2010 at 20:05 | comment | added | feal87 | I thought a little.... Can't i simply precalculate the vertexes of the various edges manually using 3 planes as I have a limited (ALWAYS The same) number of planes/vertex to calculate? Someone has an image with the simmetry axes of the cube? So i can take a look. This way it should be quite faster (I just calculate the right vertex) :P | |
| Feb 1, 2010 at 18:03 | history | edited | feal87 | CC BY-SA 2.5 |
added 123 characters in body
|
| Feb 1, 2010 at 17:58 | comment | added | TonyK | In other words, your axes are the symmetry axes of the cube :-) (and my question about whether they all intersect was a stupid one). By the 'bounding planes', I meant the surface of the k-DOP: if you treat them as opaque, then you only draw lines that are not obscured by the k-DOP itself (so a cube would typically require nine lines instead of twelve). | |
| Feb 1, 2010 at 17:40 | history | edited | feal87 | CC BY-SA 2.5 |
added 865 characters in body; added 8 characters in body
|
| Feb 1, 2010 at 17:32 | comment | added | TonyK | Now we're talking milliseconds, perhaps you can fill in some of the details. How many axes are there, and can you give a simple description of them (e.g. symmetry axes of the cube)? Are the axes fixed in space, with only their min/max values changing? Is your point of view at infinity (and is it fixed)? Do all the axes intersect each other? And you are treating the bounding planes as opaque, right? | |
| Feb 1, 2010 at 17:21 | history | edited | feal87 | CC BY-SA 2.5 |
added 163 characters in body
|
| Feb 1, 2010 at 15:34 | comment | added | Mariano Suárez-Álvarez | For those like me who have no idea what a kDOP is, the wikipedia page at en.wikipedia.org/wiki/Bounding_volume has a small explanation. | |
| Feb 1, 2010 at 14:50 | comment | added | fedja | Just to translate it into purely math. language. You know the N half-spaces whose intersection is a convex polytope. You want to find the edges of this polytope. The trivial $O(N^3)$ algorithm (find the intersection line of each pair of planes and see what segment other half spaces cut on this line) is, apparently, too slow. How to do it faster? | |
| Feb 1, 2010 at 14:25 | history | asked | feal87 | CC BY-SA 2.5 |