Latest 0.6.0
Homepage https://github.com/hsnetzer/bird-bush
License ISC
Platforms ios 9.0
Dependencies SwiftPriorityQueue
Authors

CI Status
Version
License
Platform

Swift implementation of a k-d binary space partitioning tree. The data is stored in a pair of arrays, making serialization very straightforward. Besides the classic k-d tree queries, BirdBush also implements a geographical nearest neighbor search based on mourner’s geokdbush.

Example

To run the example project, clone the repo, and run pod install from the Example directory first.

Installation

BirdBush is available through CocoaPods. To install it, simply add the following line to your Podfile:

pod 'BirdBush', :git => 'https://github.com/hsnetzer/BirdBush'

Documentation

Initialization

Generating with locations inputted as an array of Double arrays of the form [id, lon, lat]:

var bigArray = [[Double]]()
for i in 1...10000 {
  bigArray.append([Double(i), Double.random(in: -180..<180), Double.random(in: -90...90)])
}
let bigIndex = BirdBush<Double>(locations: bigArray, getID: { return $0[0] }, getX: { return $0[1] }, getY: { return $0[2] })

Methods

around(lon: Double, lat: Double, maxResults: Int, maxDistance: Double) -> [(U, Double)]

Returns the closest points to a given geographical location in order of increasing distance. Return type is [(U, Double)] where U is type for the location ids, specified by BirdBush<U> when you initialized. The second value is a stand in for distance – to convert it to the radian central angle use centralAngle(_ h: Double). To convert central angle to distance, multiply by radius in units of your choosing, e.g. 6.371e6 meters.

  • lon: query point longitude.
  • lat: query point latitude.
  • maxResults: (optional) maximum number of points to return (Int.max by default).
  • maxDistance: (optional) maximum distance in kilometers to search within (Double.greatestFiniteMagnitude by default).

nearest(qx: Double, qy: Double) -> (U, Double)

Returns the closest point to query coordinates. Return type is (U, Double) where U is type for the location ids, specified by BirdBush<U> when you initialized. The second value is the squared euclidean distance between the points.

  • qx: query point x coord.
  • qy: query point y coord.

range(minX: Double, minY: Double, maxX: Double, maxY: Double) -> [U]

Returns the points within a given box. Return type is [U] where U is type for the location ids, specified by BirdBush<U> when you initialized.

within(qx: Double, qy: Double, r: Double) -> [U]

Returns all points within given distance from query point. Return type is [U] where U is type for the location ids, specified by BirdBush<U> when you initialized.

  • qx: query point x coord.
  • qy: query point y coord.
  • r: maximum distance.

Author & License

Bird Bush is a Swift port of Vladimir Agafonkin’s JavaScript libraries kdbush and geokdbush. BirdBush is available under the ISC license. See the LICENSE file for more info.

Latest podspec

{
    "name": "BirdBush",
    "version": "0.6.0",
    "summary": "A static kd tree for geographical purposes",
    "description": "Swift implementation of a k-d binary space partitioning tree. The data is stored in a pair of arrays, making serialization very straightforward. Besides the classic k-d tree queries, BirdBush also implements a geographical nearest neighbor search based on mourner's geokdbush.",
    "homepage": "https://github.com/hsnetzer/bird-bush",
    "license": {
        "type": "ISC",
        "file": "LICENSE"
    },
    "authors": {
        "Harry Netzer": "[email protected]"
    },
    "source": {
        "git": "https://github.com/hsnetzer/bird-bush.git",
        "tag": "0.5.0"
    },
    "platforms": {
        "ios": "9.0"
    },
    "source_files": "BirdBush/Classes/**/*",
    "dependencies": {
        "SwiftPriorityQueue": []
    },
    "swift_version": "5.0"
}

Pin It on Pinterest

Share This