I was wondering two things about the built in shape detection of Slick2D. When executed on a lot of shapes, how performant are the
containsmethods, and what kind of algorithm is behind those.
I have implemented SAT collision detection but I don't want to execute this detection on all my entities. So I thought I would use the built in methods to look for entries which are near my player, and for those do the SAT detection.
But if the built in methods are as good as or better than SAT, this wouldn't be good. Also if the built in methods need more time or are kind of heavy for the cpu.
What is the proper way to have my collision detection on the smallest amount of game objects. How would I filter only the near objects?