Hey there, I'm currently writing my final essay in computer science about the bounding box problem, which is solved with the convex hull, calculated by the Graham algorithm. I'm using Greenfoot to implement my program. I'm a bit lost in the source code of Greenfoot. My question therefore is, does anybody know how Greenfoot calculates the bounding box used for collision detection? I'm pretty sure that they use Axis-alligned minimum bounding boxes with the pixels of the image and then use a Binary Space Partition tree, but I don't know how that works. Can anybody help me for my final essay please? Thanks in advance