3

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

Bla...
  • 481
  • 4
  • 12
  • convex object of are there concave parts? – ratchet freak Jan 03 '17 at 14:16
  • @ratchetfreak I uploaded the pic of the objects. :) Just curious, what is your consideration by asking that question? – Bla... Jan 03 '17 at 14:31
  • 1
    seeing if the GJK algorithm would work. It requires convex objects. – ratchet freak Jan 03 '17 at 14:37
  • 2
    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. – Nathan Reed Jan 04 '17 at 22:23
  • @NathanReed But the broad-phase you mention will require both objects to be collided. Am I right? I prefer to define a collision, if distance between two objects are <= certain value. – Bla... Jan 05 '17 at 01:46
  • 2
    @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. – Nathan Reed Jan 05 '17 at 01:53

1 Answers1

2

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.

Community
  • 1
Joseph O'Rourke
  • 341
  • 2
  • 6
  • Thanks.. Will take a look and confirm whether it satisfy my needs or not.. :) – Bla... Jan 04 '17 at 01:09
  • 1
    What almost satisfy my need is this paper: Accurate and Fast Proximity Queries Between Polyhedra Using Convex Surface Decomposition.. – Bla... Jan 20 '17 at 11:01