I have two closed 3D objects each having a collection of points.
Obj1: $[x_{11}, y_{11}, z_{11}]\ldots[x_{1n}, y_{1n}, z_{1n}]$
Obj2: $[x_{21}, y_{21}, z_{21}]\ldots[x_{2n}, y_{2n}, z_{2n}]$
Is there a generic way/algorithm to find if Obj1 is inside/outside Obj2 ?
I have already figured an algorithm to find if Obj1 is intersecting Obj2 or not. Timing is not a constraint here; so I can apply Brute force technique.