balazon/KdTree
A Kd tree is a structure that can be used to determine which points are close to each other (neighbours) in a given set of points
Corrects the timings of a given subtitle by provided command line argument points. A point is a pair of a time and its delay in milliseconds (delay can be negative).
Public repository record indexed from GitHub. Explore verified star velocity metrics, source code repositories, and curated developer tool directories across the GitHubRepo ecosystem.
A Kd tree is a structure that can be used to determine which points are close to each other (neighbours) in a given set of points
my very own rvo (orca) solution
Some math functions (mostly geometrical), like circle-circle, line-line, line-circle intersection
A Velocity Obstacle based collision avoidance in C++ (ORCA)