korlibs-datastructure/korlibs.datastructure.ds/BVH

BVH

class BVH<T>(val dimensions: Int, width: Int = dimensions * 3, val allowUpdateObjects: Boolean = true) : Iterable<BVH.Node<T>>

A Bounding Volume Hierarchy implementation for arbitrary dimensions. NTree - A simple n-tree structure for great results.

Constructors

BVH

constructor(dimensions: Int, width: Int = dimensions * 3, allowUpdateObjects: Boolean = true)

Types

Comparators

open class Comparators

IntersectResult

data class IntersectResult<T>(val ray: BVHRay, val intersect: Double, val obj: BVH.Node<T>)

Node

data class Node<T>(var d: BVHRect, var id: String? = null, var nodes: FastArrayList<BVH.Node<T>>? = null, var value: T? = null)

RemoveSubtreeRetObject

class RemoveSubtreeRetObject<T>(var d: BVHRect, var target: T? = null, var nodes: FastArrayList<BVH.Node<T>>? = null)

Properties

allowUpdateObjects

val allowUpdateObjects: Boolean

dimensions

val dimensions: Int

root

var root: BVH.Node<T>

Functions

associateByInt

fun <T> Iterable<T>.associateByInt(block: (index: Int, value: T) -> Int): IntMap<T>

debug

fun debug(node: BVH.Node<T> = this.root, indentation: String = "")

envelope

fun envelope(): BVHRect

findAll

fun findAll(): List<BVH.Node<T>>

findAllValues

fun findAllValues(): List<T>

getObjectBounds

fun getObjectBounds(obj: T): BVHIntervals?

getObjectBoundsRect

fun getObjectBoundsRect(obj: T): BVHRect?

insertOrUpdate

fun ~~insertOrUpdate~~(intervals: BVHIntervals, obj: T)

fun insertOrUpdate(rect: BVHRect, obj: T)

intersect

fun intersect(ray: BVHIntervals, return_array: FastArrayList<BVH.IntersectResult<T>> = fastArrayListOf()): FastArrayList<BVH.IntersectResult<T>>

fun intersect(ray: BVHRay, return_array: FastArrayList<BVH.IntersectResult<T>> = fastArrayListOf()): FastArrayList<BVH.IntersectResult<T>>

intersectRay

fun ~~intersectRay~~(ray: BVHIntervals, intervals: BVHRect?): BVHRect?

fun intersectRay(ray: BVHRay, intervals: BVHRect?): BVHRect?

isEmpty

fun isEmpty(): Boolean

iterator

open operator override fun iterator(): Iterator<BVH.Node<T>>

mapDouble

inline fun <T> Iterable<T>.mapDouble(callback: (T) -> Double): DoubleArrayList

mapFloat

inline fun <T> Iterable<T>.mapFloat(callback: (T) -> Float): FloatArrayList

mapInt

inline fun <T> Iterable<T>.mapInt(callback: (T) -> Int): IntArrayList

multisorted

fun <T> Iterable<T>.multisorted(vararg props: KProperty1<T, Comparable<*>>): List<T>

remove

fun remove(obj: T)

fun ~~remove~~(intervals: BVHIntervals, obj: T? = null, comparators: BVH.Comparators = Comparators): FastArrayList<BVH.Node<T>>

fun remove(rect: BVHRect, obj: T? = null, comparators: BVH.Comparators = Comparators): FastArrayList<BVH.Node<T>>

fun ~~search~~(intervals: BVHIntervals, return_array: FastArrayList<BVH.Node<T>> = fastArrayListOf(), comparators: BVH.Comparators = Comparators): FastArrayList<BVH.Node<T>>

fun search(intervals: BVHRect, return_array: FastArrayList<BVH.Node<T>> = fastArrayListOf(), comparators: BVH.Comparators = Comparators): FastArrayList<BVH.Node<T>>

searchValues

fun ~~searchValues~~(intervals: BVHIntervals, comparators: BVH.Comparators = Comparators): List<T>

fun searchValues(rect: BVHRect, comparators: BVH.Comparators = Comparators): List<T>

sumOfDouble

@JvmName(name = "sumOfFloat")

inline fun <T> Iterable<T>.sumOfDouble(selector: (T) -> Double): Double

sumOfFloat

@JvmName(name = "sumOfFloat")

inline fun <T> Iterable<T>.sumOfFloat(selector: (T) -> Float): Float

toDoubleList

inline fun Iterable<Double>.toDoubleList(): DoubleArrayList

toFloatList

inline fun Iterable<Float>.toFloatList(): FloatArrayList

toIntList

inline fun Iterable<Int>.toIntList(): IntArrayList

toLinkedMap

fun <K, V> Iterable<Pair<K, V>>.toLinkedMap(): LinkedHashMap<K, V>

yieldTo

fun yieldTo(intervals: BVHRect, yield_leaf: (node: BVH.Node<T>) -> Unit, yield_node: (node: BVH.Node<T>) -> Unit, root: BVH.Node<T> = this.root, comparators: BVH.Comparators = Comparators)