{"push_id":1018795228,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"2770a265eef994615991a7fce98d4d62c2bd3763","before":"7965b5e2060ee1b749a90fd08e9c022075a34644","commits":[{"sha":"2770a265eef994615991a7fce98d4d62c2bd3763","author":{"email":"cd40c4632d0ae9a3e41a814a96bf8b23b15ff2de@gmail.com","name":"Christian Howard"},"message":"KD Tree, Heap, HashTable + Other Updates\n\nUpdated a lot of the data structures, even if, for some, it was just\nadding some comments and laying things out a little better.\n\nBiggest additions were for the HashTable. Added in a new data storage\nfor collisions, which is essentially a linked list. Also added in a\nhashing function for N-D coordinates and specialized a Spatial\nHashTable. The main goal of this was for use in finding nearest\nneighbors or collisions. Plan to use this for finding point collisions\nwithin irregular polyhedron.\n\nAlso took a look at the Convex Hull algorithms. I will need to heavily\nredesign these codes, especially after the major changes in all the\ndata structures.","distinct":true,"url":"https://api.github.com/repos/choward1491/Bones/commits/2770a265eef994615991a7fce98d4d62c2bd3763"}]}