Timeline for Looking for collision detection algorithms for broad and narrow phases between non-convex polyhedrons
Current License: CC BY-SA 3.0
13 events
| when toggle format | what | by | license | comment | |
|---|---|---|---|---|---|
| Sep 2, 2017 at 0:25 | comment | added | KOF | Since the decomposed convex parts are approximation of the original concave object, how do we map back the contact forces of child convex to the original shape? because there is some small gap between the vertices of child convex object to the vertices of the concave shape | |
| Sep 1, 2017 at 18:54 | comment | added | DMGregory♦ | Again, it's unclear to me why this needs a special solution. Would storing the constituent colliders in a simple array or list and iterating over each in turn not be sufficient? What specific behaviour or issue do you feel you need a specialized data structure to address? | |
| Sep 1, 2017 at 18:06 | comment | added | KOF | DMGregory: you are correct :), I forgot this. The remaining problem is the data structure implementation of such concave object, and the procedure of collision detection from other objects (need loop over every child convex?) | |
| Sep 1, 2017 at 17:55 | comment | added | DMGregory♦ | Why would it need to be different from combining multiple contact forces/impulses/torques on a single convex collider? | |
| Sep 1, 2017 at 17:38 | comment | added | KOF | Well, what i want to know is how to compute the contact forces on concave objects which has been decomposed into many convex objects. We treat the composite convex (child convex) as a whole rigid body (original concave object), calculate the forces on any of the child convex, and do cross production of these forces as a resulting force on the concave objects? | |
| Sep 1, 2017 at 17:29 | history | edited | KOF | CC BY-SA 3.0 | added 2 characters in body |
| Sep 1, 2017 at 17:03 | comment | added | DMGregory♦ | It sounds like you already have solutions applicable to broad & narrow phases: approximating with spheres and V-HACD. Those together reduce the problems to ones with well-known solutions: sphere-sphere (ie. radius checks) and convex-convex polyhedron (eg. GJK). Have you encountered a specific problem or limitation with doing collision detection this way? If so, please describe that issue and users here can try to suggest algorithms specifically to address that issue. This helps focus the question so it has a correct answer rather than an open-ended list of algorithm possibilities. | |
| Sep 1, 2017 at 16:08 | answer | added | Bálint | timeline score: 3 | |
| Sep 1, 2017 at 16:02 | history | edited | KOF | CC BY-SA 3.0 | deleted 2 characters in body |
| Sep 1, 2017 at 15:47 | history | edited | KOF | CC BY-SA 3.0 | deleted 1 character in body |
| Sep 1, 2017 at 15:23 | history | edited | KOF | CC BY-SA 3.0 | added 394 characters in body |
| Sep 1, 2017 at 15:19 | review | First posts | |||
| Sep 1, 2017 at 17:04 | |||||
| Sep 1, 2017 at 15:17 | history | asked | KOF | CC BY-SA 3.0 |