1
$\begingroup$

I have the world point positions of two objects, and would like to test if there is an intersection between the two objects from this information.

What methods can I use to test this, especially at the boundaries.

$\endgroup$
  • $\begingroup$ How are the objects represented? Surfaces modeled with triangles? $\endgroup$ – Daniel M Gessel Feb 28 '16 at 3:44
  • $\begingroup$ Yes, they are triangular poly meshes. $\endgroup$ – Aaron Barclay Feb 28 '16 at 4:18
  • $\begingroup$ approximate (conservative or not ?) or exact ? GPU assisted of pure CPU ? rigid object or deformable ? are the 2 objects arbitrary complex or at least one of both has a simple shape ? $\endgroup$ – Fabrice NEYRET Feb 28 '16 at 22:02
  • $\begingroup$ Minkowski portal refinement and also GJK are algorithms commonly used for this. $\endgroup$ – Alan Wolfe Feb 29 '16 at 4:47
2
$\begingroup$

Do you need exact triangle - triangle intersection test that is do you need to know exactly the points of intersection of each object? If you just need a simple yes / no they have intersected then you could get away with creating an AABB ( https://en.wikipedia.org/wiki/Bounding_volume ) that encompasses each object and do a AABB -> AABB ( good info here https://studiofreya.com/3d-math-and-physics/simple-aabb-vs-aabb-collision-detection/ ) intersection test? even if you need a more complex collision check Triangle -> Triangle it is always a good idea to do a simple collision check first to make sure its worth doing the complex Triangle -> Triangle intersection tests. Look here ( http://www.realtimerendering.com/intersections.html ) for all the normal object -> object intersection tests you could possibly need

$\endgroup$

Your Answer

By clicking “Post Your Answer”, you agree to our terms of service, privacy policy and cookie policy

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