2d

I'm programming a Bomberman in Java following a tutorial (this is my first game). The tutorial suggests the following code for detecting collisions. for (int p=0; p<entities.size(); p++) { for (int s=p+1; s<entities.size(); s++) { Entity me = (Entity) entities.get(p); Entity him = (Entity) entities.get(s); if (me.collidesWith(him)) { me.collidedWith(him); him.collidedWith(me); } } By now, entities is an array list containing the enemies and the player. As I want to also detect the player collides with walls, should I put every single wall or bricks tile in the level into the entities arraylist

I'm searching for the most optimized method to detect whether a point is inside an axis aligned rectangle. The easiest solution needs 4 branches (if) which is bad for performance. Given a segment [x0, x1] , a point x is inside the segment when (x0 - x) * (x1 - x) <= 0 . In two dimensions case, you need to do it twice, so it requires two conditionals. Consider BITWISE-ANDing the values of XMin-X, X-XMax, YMin-Y, Y-YMax and use the resulting sign bit. Will work with both ints and floats. I think you will need the four tests no matter what, but if you know if the point is more likely to be in or

I'm not good in math. I have 2 points, A(x1, y1) and B(x2, y2) in 2D. I need to create a virtual path from point A to B curved at R(radius), and then return an array of points which are describing this curved path, not all maybe every D(distance) from each other. In Java I need a method like this: private ArrayList<PointF> generateCurve(PointF pFrom,PointF pTo,float pRadius,float pMinDistance){ ArrayList<PointF> pOutPut = new ArrayList<PointF>(); // ...generate result to pOutPut return pOutPut; } How to do this ? Martijn Courteaux I didn't gave up and I've been working on it for a few more

I'd like to check the dimensions of an image, and then size it down if the width exceeds a given threshold. When I load a 6MB JPEG image with ImageIO.read(), the BufferedImage allocates about 45MB of heap space. Is there a way to do a passthrough image resize without loading all the data into memory? I tried passing ImageIO.read() a File object, thinking it would stream the data from disk, but it doesn't help. Check out im4java and JMagick . Both use an extremely efficient external tool called ImageMagick for image manipulation. Im4Java calls the command-line app (does work in separate process

What kind of algorithm can I use to search for an optimal (minimum area) covering of a limited region of the XY plane with n discs ( x j , y j , r j ) ? I've found many investigations on fixed radius discs, but nothing about variable radius. n is fixed but the discs can be placed freely (they're not in assigned positions and their centers are not required to be inside the region). The region is in general non-connected and non-simply connected (can be composed by multiple parts and can have holes). In my specific case is defined by multiple closed polygons (using odd-even filling rule). To