What is different in mine? Not much, except: [*] Retro-Look [*] Everything is computer generated, there are no files except lua-source in the .love [*] You can watch the computer play with itself (no, no... you've got a dirty mind) [*] On 'Hard', the computer is impossible to beat. [*] You will get ...

This happens when you set the smoothness (=subdivision depth) too high. This is also why you shouldn't use Bezier:draw(k).

I was really really bored today, so I implemented Bézier curves for LÖVE. If you want to use them in your own projects, you need both bezier.lua and vector.lua. The "api": Bezier.new(points) Creates a new Bézier curve. Points is a table of x,y pairs defining the control polygon of the curv...

That looks really cool!
Never heard of double origin graphs before and a quick google search wasn't very helpful. What are they normally used for? Did you talk about triple origin graphs (then in 3d i think) or even n-origin graphs? Interesting stuff.

I did not want to step on your toe, but as my religion forbids to think there is a great difference in the two types of fast (I do not believe in cache effects and other such blasphemous notions of actual physical machines): A O(logn) solution is measurably faster than a O(n) solution. Additionally,...

3.5th solution: Create the grid, but postprocess it using a Quadtree: Start with the whole area as the root node of the tree. Create the nodes recursively: [*] If the depth of recursion is > N (say 6, experiment on that), stop [*] If the node covers only one shapre, stop [*] if the node covers more...

I think Shape:testPoint will do exactly the same: Test if the point is right of every edge in the polygon. Anyway, for understanding the right-of-test: The cross product of two vectors will return a vector that is orthogonal to the vectors. As this is not possible for two 2D-vectors, you have to &qu...

This is actually a rather hard problem known as point location . Luckily, there are well known solutions to it. One of them uses trapezoidal maps (look here: http://cgm.cs.mcgill.ca/~athens/cs507/Projects/2002/JukkaKaartinen/ ), which is a rather fast algorithm: With n being the number of edges, you...

or this:

2D Scene Manager - I recommend something dynamic like a loose quadtree implementation What now: Scene Manager (Tool to model logical relationships between objects of a scene) or a QuadTree (Tree where a node can have 0 or 4 children which [usually] divides the space in squares for a number of purpo...