{"id":17933632,"url":"https://github.com/keyan/kdtree","last_synced_at":"2025-07-26T17:09:39.533Z","repository":{"id":87742701,"uuid":"158031741","full_name":"keyan/kdtree","owner":"keyan","description":"Spatial index for nearest neighbor queries over K-dimensional points","archived":false,"fork":false,"pushed_at":"2018-11-18T00:49:10.000Z","size":99,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-09T00:42:42.273Z","etag":null,"topics":["data-structures","geospatial"],"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/keyan.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,"governance":null}},"created_at":"2018-11-17T22:54:19.000Z","updated_at":"2020-03-23T18:48:11.000Z","dependencies_parsed_at":"2023-09-25T02:08:43.080Z","dependency_job_id":null,"html_url":"https://github.com/keyan/kdtree","commit_stats":{"total_commits":3,"total_committers":1,"mean_commits":3.0,"dds":0.0,"last_synced_commit":"e8fda3d6a6ccb1627beb6e7d4d4a784bd21dc6ec"},"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/keyan%2Fkdtree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/keyan%2Fkdtree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/keyan%2Fkdtree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/keyan%2Fkdtree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/keyan","download_url":"https://codeload.github.com/keyan/kdtree/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":246990437,"owners_count":20865471,"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":["data-structures","geospatial"],"created_at":"2024-10-28T21:41:00.571Z","updated_at":"2025-04-03T11:23:55.112Z","avatar_url":"https://github.com/keyan.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# kdtree\n\nC++11 single header file k-d tree implementation, supports dynamic insertion and nearest neighbor queries.\n\nImplementation based on lecture notes from Dr. David Mount:\nhttp://www.cs.umd.edu/users/mount/420/Lects/420lects.pdf\n\n## Usage\n\n- Copy `kdtree.h` to your project and include during compilation\n- Only supports `insert()` and `nearest()` operations\n- Example usage:\n\t```\n\t#include \"kdtree.h\"\n\n\t// Specify dimension count K\n\tKDTree tree = KDTree(3);\n\n\t// Insert points as std::vector with length K\n\tstd::vector\u003cdouble\u003e p = {1, 2, 3};\n\ttree.insert(p);\n\n\t// Query for nearest point\n\tstd::vector\u003cdouble\u003e s = {5, 6, 7};\n\tstd::vector\u003cdouble\u003e nearby_point = tree.nearest(s);\n\t```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkeyan%2Fkdtree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fkeyan%2Fkdtree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fkeyan%2Fkdtree/lists"}