- #1
TheDestroyer
- 402
- 1
Hello guys,
I'm trying to find an algorithm to solve an overlap problem between many polyhedra in space, so here this question appears.
Imagine an Ellipsoid rotated by Euler angles in 3D space. This Ellipsoid could be characterised by its 3 radii Rx,Ry and Rz, and by 3 Euler angles in space Ix,Iy and Iz.
The question is, how do I get the components of those radii in an arbitrary direction in space after it being rotated by Euler angles? is this problem easy to solve? I don't know where to start.
Thank you
I'm trying to find an algorithm to solve an overlap problem between many polyhedra in space, so here this question appears.
Imagine an Ellipsoid rotated by Euler angles in 3D space. This Ellipsoid could be characterised by its 3 radii Rx,Ry and Rz, and by 3 Euler angles in space Ix,Iy and Iz.
The question is, how do I get the components of those radii in an arbitrary direction in space after it being rotated by Euler angles? is this problem easy to solve? I don't know where to start.
Thank you