{"id":20043387,"url":"https://github.com/dyanikoglu/2dimensionalkdtree","last_synced_at":"2025-03-02T07:22:32.033Z","repository":{"id":98136332,"uuid":"84645473","full_name":"dyanikoglu/2DimensionalKDTree","owner":"dyanikoglu","description":"A 2D k-dimensional tree implementation with Java","archived":false,"fork":false,"pushed_at":"2017-03-16T20:39:31.000Z","size":52,"stargazers_count":1,"open_issues_count":1,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-01-12T19:44:58.673Z","etag":null,"topics":["computational-geometry","java","kdtree","kdtrees","tree"],"latest_commit_sha":null,"homepage":"","language":"Java","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/dyanikoglu.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,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-03-11T11:34:51.000Z","updated_at":"2023-01-08T11:15:24.000Z","dependencies_parsed_at":null,"dependency_job_id":"feb617ee-9d3b-46e6-96a3-540872f0fbb8","html_url":"https://github.com/dyanikoglu/2DimensionalKDTree","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/dyanikoglu%2F2DimensionalKDTree","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dyanikoglu%2F2DimensionalKDTree/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dyanikoglu%2F2DimensionalKDTree/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/dyanikoglu%2F2DimensionalKDTree/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/dyanikoglu","download_url":"https://codeload.github.com/dyanikoglu/2DimensionalKDTree/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":241471852,"owners_count":19968288,"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":["computational-geometry","java","kdtree","kdtrees","tree"],"created_at":"2024-11-13T10:56:08.357Z","updated_at":"2025-03-02T07:22:31.992Z","avatar_url":"https://github.com/dyanikoglu.png","language":"Java","funding_links":[],"categories":[],"sub_categories":[],"readme":"# 2 Dimensional kd-tree \n\n## How to compile and run the program\n\n```\njavac KDQuery.java\njava KDQuery points.txt directives.txt\n```\n\n## Input Files\n\n### Points Input File\n\nExample file, first column is x coordinate and second column is y coordinate:\n```\n1 0\n2 3\n4 5\n6 7\n```\n\n### Directives Input File\n\nExample file, first column is directive, other columns are parameters of directive:\n```\nfindMaxY\ndisplay-tree\ndisplay-points\nrange 0 0 10 10\ninsert 0 0.5\nquit\n```\n\n#### Directives\n\n##### insert x y\nInsert point (x,y) into the tree\n##### remove x y\nRemove point (x,y) from the tree\n##### search x y\nSearch for point (x,y) in the tree\n##### findMinX\nPrint the point with the smallest x coordinate\n##### findMinY\nPrint the point with the smallest y coordinate\n##### findMaxX\nPrint the point with the largest x coordinate\n##### findMaxY\nPrint the point with the largest y coordinate\n##### display-tree\nDisplay the tree\n##### display-points\nPrint a list of points from left to right\n##### range llx lly urx ury\nPrint the list of points within the rectangle specified by lowerleft corner (llx, lly) and upperright corner (urx, ury)\n##### quit\nEnd program\n\n## Known Bugs and Limitations\n\n- Point values can't be bigger than Double.MAX_VALUE or smaller than -Double.MAX_VALUE\n- General Position rules(no same x or y coords between 2 different points) apply.\n- As far as I tested, Insert \u0026 Remove methods must work correctly in any case. Whole tree can be removed or a brand new tree can be created from scratch with these methods.\n- For range directive, given range can't be a line or a point.\n\n## Source Files\n\n- KDNode.java\n- KDTree.java\n- KDTreeQuery.java\n- NodeData.java\n- RectangularHalfPlane.java\n\n## Licence\n\nCopyright (C) 2015-2016 Doga Can Yanikoglu\n\nThis program is free software: you can redistribute it and/or modify it under the terms of the GNU General Public License as published by the Free Software Foundation, either version 3 of the License, or (at your option) any later version.\n\nThis program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU General Public License for more details.\n\nYou should have received a copy of the GNU General Public License along with this program. If not, see http://www.gnu.org/licenses/\n\n## Contributing\n\nContributors are encouraged to fork this repository and issue pull requests.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdyanikoglu%2F2dimensionalkdtree","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fdyanikoglu%2F2dimensionalkdtree","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fdyanikoglu%2F2dimensionalkdtree/lists"}