The idea behind the algorithm is, that all AABB’s vertices can be formed by choosing components from min and max, i.e. 2^3 possibilies = 8 points. For radius you choose the component producing the greatest radius, you have a + or - component to choose from and you choose the one producing the greatest aabb radius (which is equivalent to std::abs()-ing all matrix components before multiplying with the radius vector b). The min-max transformation is similar, but usually runs more slowly than the cr transformation.
sorry internet went weird on me. anyway thanks for the info. I eventually did get it work correctly. I was doing it by using the get the corners from min-max. It’s good to know this way and will use it when I need too but for now the min-max is good.