Back to General and Gameplay Programming

Automatically merge adjacent tiles for collision?

Storyyeller · 2011-06-29T00:55:07

So I am making a 2d tilebased puzzle platformer game. It's convenient to store the basic level geometry as a giant bit array that says whether there's a block at any given location. This is very memory compact and easy to query as well. When looking for collisions, I test each object agaisnt every nearby square and perform collision response calculations against every block individually. The problem is that this is inefficient. Most of the time, blocks will form much larger surfaces and contiguous rectangles that span multiple blocks. What would be ideal is a way to automatically recognize this and do a collision test against all the blocks as a single larger rectangle. This is not only faster but also leads to slightly more accurate physics. The problem is that I don't know of any easy and simple way to automatically detect and merge blocks like that.

General and Gameplay Programming Programming

Started by Storyyeller June 22, 2011 11:24 PM

9 comments, last by Storyyeller 12 years, 10 months ago

Storyyeller

215

Author

June 29, 2011 12:55 AM

Well it's hard to explain without a diagram, but during the postition solving, the cube gets moved away from both faces of the corner, instead of just the one with the smallest penetration.

I trust exceptions about as far as I can throw them.

Automatically merge adjacent tiles for collision?

This topic is closed to new replies.

Popular Topics

Recommended Tutorials

Automatically merge adjacent tiles for collision?

This topic is closed to new replies.

Popular Topics

Recommended Tutorials

Reticulating splines