| { |
| "name": "KDTree", |
| "version": "0.5.1", |
| "summary": "Swift implementation of a k-dimensional binary space partitioning tree.", |
| "description": "Swift implementation of a k-dimensional binary space partitioning tree. Useful for O(log(N)) nearest neighbour searches.", |
| "homepage": "https://github.com/Bersaelor/KDTree", |
| "screenshots": [ |
| "https://raw.githubusercontent.com/Bersaelor/KDTree/master/Screenshots/kNearest.png", |
| "https://raw.githubusercontent.com/Bersaelor/KDTree/master/Screenshots/tesselations.png" |
| ], |
| "license": "MIT", |
| "authors": { |
| "Konrad Feiler": "konrad@tactica.de" |
| }, |
| "source": { |
| "git": "https://github.com/Bersaelor/KDTree.git", |
| "tag": "0.5.1" |
| }, |
| "social_media_url": "https://twitter.com/bersaelor", |
| "platforms": { |
| "ios": "8.0", |
| "osx": "10.10", |
| "tvos": "9.2" |
| }, |
| "requires_arc": true, |
| "source_files": "Sources/*", |
| "pushed_with_swift_version": "3.0" |
| } |
