Look at the picture.
The figure on the left shows the individual box colliders in green.
The yellow boxes on the right are the results of the optimization of the original box colliders.
What is the algorithm that makes this possible?
\$\begingroup\$
\$\endgroup\$
2
-
\$\begingroup\$ similar to : Combining Many Small Colliders into Larger Ones : gamedev.stackexchange.com/questions/109687/… \$\endgroup\$– dnk drone.vs.dronesJul 13, 2017 at 10:38
-
\$\begingroup\$ Also similar to: Algorithm for healing multiple rectangles into a smaller number of rectangles \$\endgroup\$– DMGregory ♦Jul 13, 2017 at 11:24
Add a comment
|
1 Answer
\$\begingroup\$
\$\endgroup\$
2
Sure you can.
Assuming you have a list of BoxCollider that need to be combined, you can access each of their bounds properties, which consist of the boxes' center and extents. With this two information in mind, you can easily calculate the minimum and maximum x, y, and z coordinates of the boxes.
The combined BoxCollider will have these two corners: 
and 
. From upper and lower corners, you can calculate the center and extents of the combined BoxCollider.
All you need to do later is remove or disable initial BoxColliders in your list.
-
\$\begingroup\$ Can't you just manually edit the box colliders and make it bigger ? \$\endgroup\$ Jul 13, 2017 at 9:28
-
1\$\begingroup\$ @Shashimee I believe the OP is asking for dynamically merging the colliders. Otherwise it's not called merging, it's simply resizing a collider. \$\endgroup\$– TomTsagkSep 20, 2019 at 14:33