Very interesting question. I wanted to implement this into mine 4D rendering engine as I was curious how would it look like but I was too lazy and incompetent to handle ND transcendent problems from the math side. Instead I come up with different solution to this problem. Its not a Fibonaci Latice !!! Instead … Read more
atan2(s_y, s_x) should give you the correct angle. Maybe you have reversed the order of s_x and s_y. Also, you can use the acos and asin functions directly on s_x and s_y respectively.
The projection of a point q = (x, y, z) onto a plane given by a point p = (a, b, c) and a normal n = (d, e, f) is q_proj = q – dot(q – p, n) * n This calculation assumes that n is a unit vector.
Start with the rightmost point (the point with the biggest x coordinate) Get all edges from this point Follow the edge with the smallest angle to the positive x-axis, and also add it to the solution set From the point reached, follow and add the edge with the smallest angle to the edge you came … Read more
Not only is x + y + z = 0, but the absolute values of x, y and z are equal to twice the radius of the ring. This should be sufficient to identify every hexagon on each successive ring: var radius = 4; for(var i = 0; i < radius; i++) { for(var j … Read more
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
I’m not sure I understand if there is a difference between a finite state machine and a state machine? Am I thinking about this too hard? Yes, you are thinking about it too hard. 🙂 It depends on context. Obviously, taken literally, the term “finite state machine” indicates a finite number of states, while “state … Read more
From your description, it ought to be doing this, right? low2 + (value – low1) * (high2 – low2) / (high1 – low1) Find how far you are into the first range, scale that distance by the ratio of sizes of the ranges, and that’s how far you should be into the second range.
Overflow flags get set when the register cannot properly represent the result as a signed value (you overflowed into the sign bit). Carry flags are set when the register cannot properly represent the result as an unsigned value (no sign bit required).
Why is the range of unsigned byte is from -128 to 127? It’s not. An unsigned byte (assuming 8-bit) is from 0 to 255. The range of a signed byte using 2’s complement is from -128 to 127, directly from the definition of 2’s complement: 01111111 = +127 01111110 = +126 01111101 = +125 … … Read more