|Project Name||Stars||Downloads||Repos Using This||Packages Using This||Most Recent Commit||Total Releases||Latest Release||Open Issues||License||Language|
|Write A Hash Table||2,439||3 years ago||19||mit|
|✏️ Learn how to write a hash table in C|
|Hashmap||226||25 days ago||1||mit||C|
|Templated type-safe hashmap implementation in C using open addressing and linear probing for collision resolution.|
|Spatial Collision Datastructures||94||5 years ago||ms-rl||C++|
|Benchmark of various spatial data structures for collision detection.|
|Quadtree Lib||37||4||4||2 months ago||15||August 30, 2017||1||mit||CoffeeScript|
|Efficient quadtrees library written in CoffeeScript.|
|Clj Similar||16||7 years ago||7||July 20, 2016||epl-1.0||Java|
|Experimental library for similar set lookup using MinHash and k-d trees|
|Collisiondetection.jl||6||6 months ago||1||other||Julia|
|Tree data structure for log(N) collision testing|
|D Left||5||6 years ago||mit||C|
|data structure to store data, rapidly, memory-efficiently and with less collision|
|C Dict||3||4 years ago||C|
|A tiny library that brings the support of dictionaries to C programming language with a fast lookup using hash tables. dict type can be used to associate large arrays with string keys.|
|Quadtree||2||8 years ago||Java|
|Visualition demo of QuadTree (collisions and game of life)|
This project is a benchmark tool used to assess performance of different collision detection data structures.
Most of these data structures were taken Christer Ericson's Real-Time collision detection (Morgan Kaufmann Publishers 2004) book.
The Kd-Tree SAH idea was taken from Maxim Shevtsov, Alexei Soupikov, Alexander Kapustin, Intel Corporation, 2007, "Highly Parallel Fast KD‐tree Construction for Interactive Ray Tracing of Dynamic Scenes" paper.
The implemented data structures are:
A small demo application was written (using GLUT and FF OpenGL) to help visualize and compare the tested data structures.
Please see LICENSE file for License information.
All code is (c) Mykola Konyk, 2008.