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
Public GitHub Catalog
Discovered Oct 1, 2026
balazon / gittestrepoName
git test repo
About this discovery
Public repository record indexed from GitHub. Explore verified star velocity metrics, source code repositories, and curated developer tool directories across the GitHubRepo ecosystem.
#20895453GitHub System ID
balazonOrganization / User
PublicVisibility
ActiveCatalog Status
More from balazon
balazon/SubtitleCorrector
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).
balazon/UnrealRVO
my very own rvo (orca) solution
balazon/MathUtils
Some math functions (mostly geometrical), like circle-circle, line-line, line-circle intersection