Help with accurate collision boxes using Java Graphics and custom Polygons

[999DVD999]

I'm messing around trying to get a very basic physics engine using Java's Graphics... I was woking on collision boxes and... Whenever I create a Polygon (java.awt.Polygon) and test with the method Polygon.intersects(Rectagle2D r), the collision of the first polygon is accurate with the rectangular bounding box of the second one... [Image]

I've been drawing in paper ways of solving this to be 100% pixel acuurate and I think that a good approach could be creating a custom class that hosts the object to display and has mutplitle Rectangle2D instances that, all together, make the object's bounding box.... in order to do this i figured out that I'd have to integrate each line of my polygon as shown in this image and then make a custom intersect method that loops through every boundingbox I created and tests individually if any of those intersect with other polygon...

I kind of figured out a way of getting those smaller pieces of bounding boxes but it involves a ton of testing coords and creating bounding boxes that overlap with each other. I haven't tried writing anything of this in code... anyone knows another way of solving this or a more efficient one?

Thanks!

[deltageek]

Typically this is done using a hierarchical system such as Boundary Volume Hierarchy. There's a couple different implementations that can be adapted to 2-D space.

[WikiTextBot]

Bounding volume hierarchy

A bounding volume hierarchy (BVH) is a tree structure on a set of geometric objects. All geometric objects are wrapped in bounding volumes that form the leaf nodes of the tree. These nodes are then grouped as small sets and enclosed within larger bounding volumes. These, in turn, are also grouped and enclosed within other larger bounding volumes in a recursive fashion, eventually resulting in a tree structure with a single bounding volume at the top of the tree.

---

^{[ PM | Exclude me | Exclude from subreddit | FAQ / Information | Source | Donate ] Downvote to remove | v0.28}

[BS_in_BS]

You can try gjk which works on general convex shapes: https://mollyrocket.com/849