{"id":24539974,"url":"https://github.com/codeandcats/kdtree","last_synced_at":"2025-05-16T15:03:24.280Z","repository":{"id":12138240,"uuid":"14730879","full_name":"codeandcats/KdTree","owner":"codeandcats","description":"A fast, generic, multi-dimensional Binary Search Tree written in C#","archived":false,"fork":false,"pushed_at":"2020-06-25T11:01:19.000Z","size":54,"stargazers_count":255,"open_issues_count":7,"forks_count":88,"subscribers_count":11,"default_branch":"master","last_synced_at":"2025-04-03T11:11:14.316Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":null,"language":"C#","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":"Moishe/SmartTrail-for-Android","license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/codeandcats.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2013-11-26T22:20:29.000Z","updated_at":"2025-03-08T10:15:30.000Z","dependencies_parsed_at":"2022-08-07T06:16:45.364Z","dependency_job_id":null,"html_url":"https://github.com/codeandcats/KdTree","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codeandcats%2FKdTree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codeandcats%2FKdTree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codeandcats%2FKdTree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/codeandcats%2FKdTree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/codeandcats","download_url":"https://codeload.github.com/codeandcats/KdTree/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248564913,"owners_count":21125412,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2025-01-22T17:17:29.114Z","updated_at":"2025-04-12T11:49:46.577Z","avatar_url":"https://github.com/codeandcats.png","language":"C#","funding_links":[],"categories":[],"sub_categories":[],"readme":"KdTree\n======\n\nA fast, generic, and multi-dimensional Binary Search Tree written in C#.\n\n# Install\n\nInstall via NuGet Package Manager Console:\n\n```\nPM\u003e Install-Package KdTree\n```\n\n# Examples \n\n## Find nearest point in two dimensions\n\n```cs\nvar tree = new KdTree\u003cfloat, int\u003e(2, new FloatMath());\ntree.Add(new[] { 50.0f, 80.0f }, 100);\ntree.Add(new[] { 20.0f, 10.0f }, 200);\n\nvar nodes = tree.GetNearestNeighbours(new[] { 30.0f, 20.0f }, 1);\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodeandcats%2Fkdtree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fcodeandcats%2Fkdtree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fcodeandcats%2Fkdtree/lists"}