I found this question very interesting since I had recently done some work on modeling projectile motion with drag. Point 1: You are essentially updating the position and velocity using an explicit/forward Euler iteration where each new value for the states should be a function of the old values. In such a case, you should … Read more
[hill generation, perlin, diamond square] … this kind of algorithms seems suitable when dealing with tile maps that also have a height component but this is not my case. But it is your case. Mountains are higher than plains, and plains are higher than water. ___/ ___/ ___ Mountain cutoff ___/ ______/ ____/ ___ Water … Read more
You have compositing operations, and one of them is destination-atop. If you composite an image onto a solid color with the ‘context.globalCompositeOperation = “destination-atop”‘, it will have the alpha of the foreground image, and the color of the background image. I used this to make a fully tinted copy of an image, and then drew … Read more
Playcraft seems to support hex grids, at least in the announced 0.5.6 release: Here’s a big list of things we’ve changed: * hex tile maps now supported using (pc.HexTileLayer) The code is on Github. The project looks inactive since July 2013.
Nasty little problem… I have been fooling around with this toy example: >>> arr = np.array([[‘one’, [1, 2, 3]],[‘two’, [4, 5, 6]]], dtype=np.object) >>> arr array([[‘one’, [1, 2, 3]], [‘two’, [4, 5, 6]]], dtype=object) My first guess was: >>> np.array(arr[:, 1]) array([[1, 2, 3], [4, 5, 6]], dtype=object) But that keeps the object dtype, so … Read more
I think it’s easiest to think of your problem as an intersection problem: what is the parameter location (s,t) where the point p intersects the arbitrary 2D bilinear surface defined by p0, p1, p2 and p3. The approach I’ll take to solving this problem is similar to tspauld’s suggestion. Start with two equations in terms … Read more
Don’t forget that you don’t need to bother with the square root. If you just want to find the nearest one (and not it’s actual distance) just use dx^2 + dy^2, which will give you the distance squared to the each item, which is just as useful. If you have no data structure wrapping this … Read more
From my “Geometry” class: public struct Line { public static Line Empty; private PointF p1; private PointF p2; public Line(PointF p1, PointF p2) { this.p1 = p1; this.p2 = p2; } public PointF P1 { get { return p1; } set { p1 = value; } } public PointF P2 { get { return p2; … Read more
You cannot use indexOf to do complicated arrays (unless you serialize it making everything each coordinate into strings), you will need to use a for loop (or while) to search for that coordinate in that array assuming you know the format of the array (in this case it is 2d). var arr = [[2,3],[5,8],[1,1],[0,9],[5,7]]; var … Read more
System.Drawing.Point represents a GDI point and is used in Windows Forms. It can only hold integer values. WPF doesn’t use GDI anymore, so it has its own System.Windows.Point type to represents a point, which can have non integer values.