{"id":27863276,"url":"https://github.com/begeekmyfriend/kdtree","last_synced_at":"2025-05-04T20:47:17.907Z","repository":{"id":17827724,"uuid":"82787592","full_name":"begeekmyfriend/kdtree","owner":"begeekmyfriend","description":"Absolute balanced kdtree for fast kNN search.","archived":false,"fork":false,"pushed_at":"2023-09-13T00:58:08.000Z","size":29,"stargazers_count":170,"open_issues_count":0,"forks_count":35,"subscribers_count":13,"default_branch":"master","last_synced_at":"2023-11-07T22:19:32.049Z","etag":null,"topics":["algorithm","k-means","k-nearest-neighbours","kd-tree","kd-trees","kdtrees","kmeans","knn","knn-search","tree-structure"],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/begeekmyfriend.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":"2017-02-22T09:43:44.000Z","updated_at":"2023-11-07T22:19:32.050Z","dependencies_parsed_at":"2023-01-11T19:42:13.770Z","dependency_job_id":null,"html_url":"https://github.com/begeekmyfriend/kdtree","commit_stats":null,"previous_names":[],"tags_count":0,"template":null,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/begeekmyfriend%2Fkdtree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/begeekmyfriend%2Fkdtree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/begeekmyfriend%2Fkdtree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/begeekmyfriend%2Fkdtree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/begeekmyfriend","download_url":"https://codeload.github.com/begeekmyfriend/kdtree/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":252399528,"owners_count":21741669,"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":["algorithm","k-means","k-nearest-neighbours","kd-tree","kd-trees","kdtrees","kmeans","knn","knn-search","tree-structure"],"created_at":"2025-05-04T20:47:17.228Z","updated_at":"2025-05-04T20:47:17.896Z","avatar_url":"https://github.com/begeekmyfriend.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# kdtree\nThis is a (nearly absolute) balanced kdtree for fast kNN search. It does not\nsupport dynamic insertion and removal. Actually we adopt quick sort to rebuild\nthe whole tree after changes of nodes. We cache the added or the deleted nodes\nwhich will not be actually mapped into the tree until the rebuild method to be\ninvoked. The good thing is we can always keep the tree balanced, and the bad\nthing is we have to wait some time for the finish of tree rebuild. Moreover,\nduplicated samples are allowed to be added.\n\nThe thought of the implementation is posted [here](https://www.joinquant.com/post/2843).\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbegeekmyfriend%2Fkdtree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fbegeekmyfriend%2Fkdtree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fbegeekmyfriend%2Fkdtree/lists"}