3
$\begingroup$

I have two high-resolution 3D objects(femur and patella) with arbitrary smooth surface and I want to find the contact point/area between those two objects. Accuracy is more important than computation time in this case, though it would be great if the algorithm has relatively low computation time. Also, it would be great if the contact between two objects can be represented with surface/point penetration distance, e.g. if distance between two points/triangles/areas <= x distance, then there is collision, while x can be non-zero. Is there any collision algorithm that satisfy above requirement?

objects' shape

Improve this question
$\endgroup$
6
  • $\begingroup$ convex object of are there concave parts? $\endgroup$
    – ratchet freak
    Commented Jan 3, 2017 at 14:16
  • $\begingroup$ @ratchetfreak I uploaded the pic of the objects. :) Just curious, what is your consideration by asking that question? $\endgroup$
    – Bla...
    Commented Jan 3, 2017 at 14:31
  • 1
    $\begingroup$ seeing if the GJK algorithm would work. It requires convex objects. $\endgroup$
    – ratchet freak
    Commented Jan 3, 2017 at 14:37
  • 2
    $\begingroup$ I think a typical approach would be to use a BSP tree to split the object into concave parts, then use BVH sweep and prune (broad-phase) + GJK (narrow-phase) to get exact collision. $\endgroup$
    – Nathan Reed
    Commented Jan 4, 2017 at 22:23
  • 2
    $\begingroup$ @Bla... You can inflate all the bounding boxes (or bounding spheres or whatever) by the tolerance, or build the tolerance into the broad-phase intersection tests. $\endgroup$
    – Nathan Reed
    Commented Jan 5, 2017 at 1:53

1 Answer 1

Reset to default
2
$\begingroup$

A key search phrase is "collision detection." You may find some references at this MO posting, "Intersection of Polyhedra." And here is a more recent reference:

Jiménez, Juan J., and Rafael J. Segura. "Collision detection between complex polyhedra." Computers & Graphics 32.4 (2008): 402-411. (Journal link.)

Google Scholar shows this has been cited by 33 papers since.

Improve this answer
$\endgroup$
2
  • $\begingroup$ Thanks.. Will take a look and confirm whether it satisfy my needs or not.. :) $\endgroup$
    – Bla...
    Commented Jan 4, 2017 at 1:09
  • 1
    $\begingroup$ What almost satisfy my need is this paper: Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition.. $\endgroup$
    – Bla...
    Commented Jan 20, 2017 at 11:01

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service and acknowledge you have read our privacy policy.

Not the answer you're looking for? Browse other questions tagged or ask your own question.