mgo/mgo.tools/KDTree

KDTree

object KDTree
Companion
class
class Object
trait Matchable
class Any

Value members

Concrete methods

def apply(pointList: Seq[Seq[Double]]): KDTree
Value Params
pointList

A size N sequence of size K sequences, representing N points in K dimensions

def argSort(a: Seq[Double]): Vector[Int]
def build(pointList: Seq[Seq[Double]], sortedDims: Seq[Vector[Int]], depth: Int): KDTree
def findLeftMostMedian(points: Seq[Double], sortedIndices: Vector[Int]): (Int, Double)
def splitIdArrays(points: Seq[Double], sortedIndices: Vector[Int], splitPoint: Int): (Vector[Int], Vector[Int])

split the sorted indices according to threshold, such that elements in res._1 refer to points < threshold, and res._2 to points >= threshold. The element splitPoint excluded from the result

split the sorted indices according to threshold, such that elements in res._1 refer to points < threshold, and res._2 to points >= threshold. The element splitPoint excluded from the result

def transpose(pointList: Seq[Seq[Double]]): Seq[Seq[Double]]