{"id":16141101,"url":"https://github.com/izzhafeez/szmatrix","last_synced_at":"2025-04-06T18:34:57.799Z","repository":{"id":136997110,"uuid":"530700053","full_name":"izzhafeez/SZMatrix","owner":"izzhafeez","description":"Space-partitioning data structure to improve queries for clustered points in 2D space","archived":false,"fork":false,"pushed_at":"2022-09-01T13:54:05.000Z","size":8,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-02-13T00:37:30.934Z","etag":null,"topics":["cpp","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":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/izzhafeez.png","metadata":{"files":{"readme":"README.md","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,"governance":null}},"created_at":"2022-08-30T14:42:23.000Z","updated_at":"2023-03-01T22:44:18.000Z","dependencies_parsed_at":"2023-09-25T01:47:24.785Z","dependency_job_id":null,"html_url":"https://github.com/izzhafeez/SZMatrix","commit_stats":{"total_commits":8,"total_committers":2,"mean_commits":4.0,"dds":0.125,"last_synced_commit":"59e64e5e93e6810b2887dcfaa83148aa735da735"},"previous_names":["izzhafeez/szmatrix"],"tags_count":1,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/izzhafeez%2FSZMatrix","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/izzhafeez%2FSZMatrix/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/izzhafeez%2FSZMatrix/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/izzhafeez%2FSZMatrix/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/izzhafeez","download_url":"https://codeload.github.com/izzhafeez/SZMatrix/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":247533299,"owners_count":20954358,"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":["cpp","data-structures","geospatial"],"created_at":"2024-10-09T23:54:32.069Z","updated_at":"2025-04-06T18:34:57.772Z","avatar_url":"https://github.com/izzhafeez.png","language":"C++","funding_links":[],"categories":[],"sub_categories":[],"readme":"# SZMatrix\nSpace-partitioning data structure to improve queries for clustered points in 2D space\n\nI had this idea of efficient storage of geographic points. Essentially, we have a rectangular area in 2D space split into 4 equal parts. We then add points to this area. When the number of points in the rectangle becomes too large, we split, or 'balance' the data structure, by duplicating the data structure 4 times. In this way, we can increase the memory allocated to certain regions, allowing for appropriate representation of clustered points.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fizzhafeez%2Fszmatrix","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fizzhafeez%2Fszmatrix","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fizzhafeez%2Fszmatrix/lists"}