{"id":23265733,"url":"https://github.com/andreip/nns","last_synced_at":"2025-04-06T07:34:00.356Z","repository":{"id":140786582,"uuid":"1818948","full_name":"andreip/NNS","owner":"andreip","description":"Nearest neighbour search - K-D tree","archived":false,"fork":false,"pushed_at":"2011-06-01T17:52:24.000Z","size":92,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-02-12T12:57:00.723Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"C","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/andreip.png","metadata":{"files":{"readme":"README","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2011-05-29T21:35:30.000Z","updated_at":"2014-01-18T06:34:35.000Z","dependencies_parsed_at":"2023-03-13T10:40:18.090Z","dependency_job_id":null,"html_url":"https://github.com/andreip/NNS","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/andreip%2FNNS","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andreip%2FNNS/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andreip%2FNNS/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/andreip%2FNNS/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/andreip","download_url":"https://codeload.github.com/andreip/NNS/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247450800,"owners_count":20940938,"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":"2024-12-19T15:32:15.913Z","updated_at":"2025-04-06T07:34:00.331Z","avatar_url":"https://github.com/andreip.png","language":"C","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Petre Andrei-Nicuale\n\n\tPentru a cauta mai eficient in planul xOy, am construit un K-D tree. Mai\nexact, am creat arborele considerat ca nivelele pare sunt asociate axelor x,\niar cele impare, axelor y. Apoi adaugarea se face ca la arbori binari de cautare\n, dar comparand, in functie de nivel, cu coordonata x, respectiv y.\n\tOdata construit, parcurg arborele pentru fiecare coordonata si obtin un\ncel mai aproape, pe care il updatez pana ajung in frunza. Asta se face in\ncomplexitate logaritmica.\n\tApoi, la descarcarea stivei, se verifica daca cercul cu raza r = distanta\nintre \"request\" si \"cel mai aproape\" intersecteaza axa nodului curent, iar\ndaca da, inseamna ca poate fi un nod mai aproape ca \"cel mai aproape\", altfel,\ntrecem mai departe (cel mai aproape se updateaza continuu).\n\n\n\tO posibila optimizare ar fi sa se formeze mereu arborele echilibrat. Asta\ns-ar putea face mai usor, alegand nodurile in ordine random, dar ar necesita,\nin momentul de fata, utilizare de memorie suplimentara.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandreip%2Fnns","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fandreip%2Fnns","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fandreip%2Fnns/lists"}