NNIndex

a data structure used to search the neighbour you can add elements like map structure:

@{code
  val index[Int] = NNIndex(Map.empty)
  index += Point3D -> 0

  val elems = (0 to 100) map {x => Point3D(math.random,math.random,math.random) -> x}

  index ++= elems
}

you can find neighbours using in this way:

@{code
  val radiusSearch = 10
  val neighbour = index.neighbours(Point3D(0,0,0),radiusSearch)
}

A: the value ok key

Linear Supertypes

AnyRef, Any

Abstract Value Members

abstract def ++=(elems: Iterable[(Point3D, A)]): NNIndex.this.type

allow to add a set of elements in the neighbour index
allow to add a set of elements in the neighbour index
elems
the elements to add in the data structure
returns
the data structure
abstract def +=(elem: (Point3D, A)): NNIndex.this.type
abstract def -=(elem: Point3D): NNIndex.this.type
abstract def get(elem: Point3D): Option[A]
abstract def neighbours(p: Point3D, r: Double): Iterable[(Point3D, A)]

search the neighbours near a point p
search the neighbours near a point p
p
the center of search
r
the radius

Concrete Value Members

final def !=(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def ##(): Int

Definition Classes
AnyRef → Any
final def ==(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def asInstanceOf[T0]: T0

Definition Classes
Any
def clone(): AnyRef

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate() @throws( ... )
final def eq(arg0: AnyRef): Boolean

Definition Classes
AnyRef
def equals(arg0: Any): Boolean

Definition Classes
AnyRef → Any
final def getClass(): Class[_]

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
def hashCode(): Int

Definition Classes
AnyRef → Any
Annotations
@HotSpotIntrinsicCandidate()
final def isInstanceOf[T0]: Boolean

Definition Classes
Any
final def ne(arg0: AnyRef): Boolean

Definition Classes
AnyRef
final def notify(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def notifyAll(): Unit

Definition Classes
AnyRef
Annotations
@HotSpotIntrinsicCandidate()
final def synchronized[T0](arg0: ⇒ T0): T0

Definition Classes
AnyRef
def toString(): String

Definition Classes
AnyRef → Any
final def wait(arg0: Long, arg1: Int): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(arg0: Long): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )
final def wait(): Unit

Definition Classes
AnyRef
Annotations
@throws( ... )

Deprecated Value Members

def finalize(): Unit

Attributes
protected[java.lang]
Definition Classes
AnyRef
Annotations
@Deprecated @deprecated @throws( classOf[java.lang.Throwable] )
Deprecated
(Since version ) see corresponding Javadoc for more information.

Related Docs: object NNIndex | package nn

trait NNIndex[A] extends AnyRef

Abstract Value Members

abstract def ++=(elems: Iterable[(Point3D, A)]): NNIndex.this.type

abstract def +=(elem: (Point3D, A)): NNIndex.this.type

abstract def -=(elem: Point3D): NNIndex.this.type

abstract def get(elem: Point3D): Option[A]

abstract def neighbours(p: Point3D, r: Double): Iterable[(Point3D, A)]

Concrete Value Members

final def !=(arg0: Any): Boolean

final def ##(): Int

final def ==(arg0: Any): Boolean

final def asInstanceOf[T0]: T0

def clone(): AnyRef

final def eq(arg0: AnyRef): Boolean

def equals(arg0: Any): Boolean

final def getClass(): Class[_]

def hashCode(): Int

final def isInstanceOf[T0]: Boolean

final def ne(arg0: AnyRef): Boolean

final def notify(): Unit

final def notifyAll(): Unit

final def synchronized[T0](arg0: ⇒ T0): T0

def toString(): String

final def wait(arg0: Long, arg1: Int): Unit

final def wait(arg0: Long): Unit

final def wait(): Unit

Deprecated Value Members

def finalize(): Unit

Inherited from AnyRef

Inherited from Any

Ungrouped