Has this ever been done before?

[K.I.L.E.R]

I've just created a quadtree that doesn't use boolean values to do any intersection checking or whether a values falls within a boundary. It's all done with 3 pieces of data. Vector = (x,y) of an object to add. Centre point of the boundary. I'm using a Heaviside function mapping to generate an array index that's dependent on the mouse vector and constant vector's dot product. Does this make me a genius?

 

[Frank]

What can you do with it?

 

[K.I.L.E.R]

You can quickly sort objects in it and detect collisions if there are any. It's main selling point is that it's the world's fastest algorithm.

 

[Capeta]

Shouldn't this be in one of the other forums related to programming and algorithms?