Data.PKTree

Implementation of the PKTree spatial index data structure

The reccomended way to import this module is:

 import qualified Data.PKTree as PKTree
 pkInsert = insert K [rx,ry,..]

Documentation

type Point = [Float]

An n-dimensional point

type Rectangle = (Point, Point)

An n-dimensional hyperrectangle

type PKTree a = Tree (Node a)

A PKTree

data Node a

Inner nodes have rectangles, leaves are points and data

Constructors

Inner Rectangle

Leaf Point a

Instances

Eq a => Eq (Node a)

Read a => Read (Node a)

Show a => Show (Node a)

cell :: Rectangle -> PKTree a

Contruct a tree with no children

pointCell :: Point -> a -> PKTree a

Construct a leaf node representing a point

rect :: PKTree a -> Rectangle

Extract the rectangle from a node

insert

Arguments

:: Eq a

=> Int

K, minimum number of nodes in subdivision

-> [Int]

r, number of divisions in each dimension

-> PKTree a

Root of PKTree

-> Point

Point to insert

-> a

Data that goes with point

-> PKTree a

Insert a point into a PKTree

radiusSearch

Arguments

:: Point

Centre of hypercircle

-> Float

Radius of hypercircle

-> PKTree a

Tree to search in

-> [(Point, a)]

Search for points in some hypercircle

cubeSearch

Arguments

:: Rectangle

Hypercube to use as bounds

-> Bool

Open hypercube?

-> PKTree a

Tree to search in

-> [(Point, a)]

Search for points in some hypercube