Narrow phase bounds checks are currently done using different methods for the two shapes, and special cased when the two collide (which won't scale).
Since all our shapes are axis aligned, generalising to use SAT collision checks should be pretty straightforward, and I think it will give us the restitution values for free, regarding the other open ticket around box corner collisions.
Proposed approach is in two stages:
Stage 1
Produce a demo that implements separating axis theorem - it could even be a fun visual demo! No need to worry about the details of integrating it into the engine at this stage because...
Stage 2
We do the engine integration. However this might depend on the ticket about collision pairs.
Narrow phase bounds checks are currently done using different methods for the two shapes, and special cased when the two collide (which won't scale).
Since all our shapes are axis aligned, generalising to use SAT collision checks should be pretty straightforward, and I think it will give us the restitution values for free, regarding the other open ticket around box corner collisions.
Proposed approach is in two stages:
Stage 1
Produce a demo that implements separating axis theorem - it could even be a fun visual demo! No need to worry about the details of integrating it into the engine at this stage because...
Stage 2
We do the engine integration. However this might depend on the ticket about collision pairs.