OK – it would appear that a simple: if bomb == nil {return} is all that’s required. This should be added as follows: let bomb = contact.bodyA.categoryBitMask == category.bomb.rawValue ? contact.bodyA.node : contact.bodyB.node if bomb == nil {return} This works to prevent multiple collisions for a node that you removeFromParent in didBeginContact. If you don;t … Read more
Your approach works fine, if the x and y component of the ray axis points in the positive direction, but it fails if it points in the negative direction. As you pointed out, that is caused by the way pygame.mask.Mask.overlap works: Starting at the top left corner it checks bits 0 to W – 1 … Read more
Several problems here. You’re defining categories in a way that keeps them from being easily tested. You’re testing categories in a way that doesn’t get you the unique answers you want. You’ve confused your code by trying to track up to four bodies in one contact. Any contact will always have exactly two bodies. Let’s … Read more
Detecting circle-rect collisions is not trivial (but not that complicated either). @kuroi neko’s solution is correct and about as simple as the code is going to get. Luckily, you don’t need to fully understand the math theory to use the hit-test function. If you do want more details about how the function works, here is … Read more
How can I perform Collision Detection on rotated rectangles? [closed]
// returns true if the line from (a,b)->(c,d) intersects with (p,q)->(r,s) function intersects(a,b,c,d,p,q,r,s) { var det, gamma, lambda; det = (c – a) * (s – q) – (r – p) * (d – b); if (det === 0) { return false; } else { lambda = ((s – q) * (r – a) + … Read more
I have based my code on Mayra’s example and made bitmap pixel collision handling. I hope this will help. public class CollisionUtil { public static boolean isCollisionDetected(Sprite sprite1, Sprite sprite2){ Rect bounds1 = sprite1.getBounds(); Rect bounds2 = sprite2.getBounds(); if( Rect.intersects(bounds1, bounds2) ){ Rect collisionBounds = getCollisionBounds(bounds1, bounds2); for (int i = collisionBounds.left; i < collisionBounds.right; … Read more
Ensure that the Player object is positioned in the center of cell of the grid. e.g. calculate a random position for the player: def load_player(background): pimg = pygame.Surface((10, 10)) pimg.fill((200, 20, 20)) px = random.randint(0, rows-1) * width + width//2 py = random.randint(0, cols-1) * width + width//2 return Player(pimg, (px, py), background) To track … Read more
You’re looking for the Minimum Volume Enclosing Ellipsoid, or in your 2D case, the minimum area. This optimization problem is convex and can be solved efficiently. Check out the MATLAB code in the link I’ve included – the implementation is trivial and doesn’t require anything more complex than a matrix inversion. Anyone interested in the … Read more
The most important theorem to know is the Separating Axis Theorem (SAT). Basicly, it allows you to detect collision between two convex polygons. A good reading material is here. If your game only concerns with convex shapes, then sat.js is a decent choice. However, if you need to work with concave shapes, you need to … Read more