The question by the OP is a bit ambiguous so the question I will answer is: How to generate a point from a uniform distribution within an arbitrary quadrilateral, which is actually a generalization of How to generate a point from a uniform distribution within an arbitrary (convex) polygon. The answer is based on the … Read more
for f(x,y) you can use f(x,y)->(a,b) 2D LUT (Look Up Table) But the stored grid points must be selected so dense so that there is max one bump per grid rectangle, otherwise interpolation would not work correctly. If you want to use linear interpolation then the local min/max must be points inside LUT, for polynomial … Read more
Not really an answer (as the code will be rewritten anyway) so few hints for the new code instead (some of them are already mentioned in the comments). Tileset In the final isometric engine use sprites. They are faster and support pixel art. For my purposes I use compilation of these two free to use … Read more
Let’s identify the patterns first .. Even-Size Square Matrix, Example: 4×4 07 > 08 > 09 > 10 ^ v 06 (01)> 02 11 ^ v v 05 < 04 < 03 12 v [16]< 15 < 14 < 13 Starting Point: [2, 2] ~ [SIZE/2, SIZE/2] Ending Point: [4, 1] ~ [SIZE, 1] Chains: … Read more
You can do this: Paint paint = new Paint(); final RectF rect = new RectF(); //Example values rect.set(mWidth/2- mRadius, mHeight/2 – mRadius, mWidth/2 + mRadius, mHeight/2 + mRadius); paint.setColor(Color.GREEN); paint.setStrokeWidth(20); paint.setAntiAlias(true); paint.setStrokeCap(Paint.Cap.ROUND); paint.setStyle(Paint.Style.STROKE); canvas.drawArc(rect, -90, 360, false, paint); The key is in paint.setStyle(Paint.Style.STROKE);, it crops the arc’s center with the stroke that you define in … Read more
The original poster wanted to DETECT an intersection between a line segment and a polygon. There was no need to LOCATE the intersection, if there is one. If that’s how you meant it, you can do less work than Liang-Barsky or Cohen-Sutherland: Let the segment endpoints be p1=(x1 y1) and p2=(x2 y2). Let the rectangle’s … Read more
I solved the equations for you: k = ((y2-y1) * (x3-x1) – (x2-x1) * (y3-y1)) / ((y2-y1)^2 + (x2-x1)^2) x4 = x3 – k * (y2-y1) y4 = y3 + k * (x2-x1) Where ^2 means squared
If you use a Camera (which you should) changing the coordinate system is pretty simple: camera= new OrthographicCamera(Gdx.graphics.getWidth(), Gdx.graphics.getHeight()); camera.setToOrtho(true, Gdx.graphics.getWidth(), Gdx.graphics.getHeight()); If you use TextureRegions and/or a TextureAtlas, all you need to do in addition to that is call region.flip(false, true). The reasons we use y-up by default (which you can easily change as … Read more
Implementation 1 returns the magnitude of the vector that would result from a regular 3D cross product of the input vectors, taking their Z values implicitly as 0 (i.e. treating the 2D space as a plane in the 3D space). The 3D cross product will be perpendicular to that plane, and thus have 0 X … Read more
I wrote an aiming subroutine for xtank a while back. I’ll try to lay out how I did it. Disclaimer: I may have made one or more silly mistakes anywhere in here; I’m just trying to reconstruct the reasoning with my rusty math skills. However, I’ll cut to the chase first, since this is a … Read more