<p>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 ( <a href="https://en.wikipedia.org/wiki/Bounding_volume" rel="nofollow">https://en.wikipedia.org/wiki/Bounding_volume</a> ) that encompasses each object and do a AABB -> AABB ( good info here <a href="https://studiofreya.com/3d-math-and-physics/simple-aabb-vs-aabb-collision-detection/" rel="nofollow">https://studiofreya.com/3d-math-and-physics/simple-aabb-vs-aabb-collision-detection/</a> ) 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 ( <a href="http://www.realtimerendering.com/intersections.html" rel="nofollow">http://www.realtimerendering.com/intersections.html</a> ) for all the normal object -> object intersection tests you could possibly need </p>

CC BY-SA 3.0
2016-02-28T05:45:40.427Z
2016-02-28T05:45:40.427Z
Garry Wallis
<p>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.</p>

<p>What methods can I use to test this, especially at the boundaries. </p>

CC BY-SA 3.0
2016-02-28T04:18:50.750Z
Yes, they are triangular poly meshes.
Aaron Barclay
CC BY-SA 3.0
2016-02-28T22:02:38.030Z
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 ?
Fabrice NEYRET
CC BY-SA 3.0
2016-02-29T04:47:15.370Z
Minkowski portal refinement and also GJK  are algorithms commonly used for this.
Alan Wolfe
<algorithm><geometry>
How to test if one object A intersects and is therefore partly or wholly inside object B
Aaron Barclay
# How to test if one object A intersects and is therefore partly or wholly inside object B

(Asked by: username_0 on 2016-02-27)

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.

**Tags:** algorithm, geometry

> **Comments:**
> **username_0**: Yes, they are triangular poly meshes.  
> **username_1**: 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 ?  
> **username_2**: Minkowski portal refinement and also GJK  are algorithms commonly used for this.  

---

## 1 answers

### Answer by username_3 on 2016-02-28. Score: 2

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


---

