DynamicTree

Explained in Your first game, Rigid bodies.

class DynamicTree

import { DynamicTree } from '@driftengine/physics';

Constructor

`new`

constructor(capacity?: number)

Parameter	Type	Description
`capacity?`	`number`

Properties

Name	Type	Description
`root`	`number`
`bounds`	`Float32Array`	minX, minY, minZ, maxX, maxY, maxZ per node.
`parent`	`Int32Array`
`child1`	`Int32Array`
`child2`	`Int32Array`
`proxy`	`Int32Array`	The caller's own id for a leaf; −1 on an internal node.
`height`	`Int32Array`

Accessors

Name	Type	Description
`count`get	`number`	How many nodes are in use. A tree of n leaves has 2n − 1 nodes.

Methods

`insert`

insert(proxyId: number, box: Aabb): number

Parameter	Type	Description
`proxyId`	`number`
`box`	`Aabb`

`remove`

remove(leaf: number): void

Parameter	Type	Description
`leaf`	`number`

`move`

move(leaf: number, box: Aabb): boolean

Re-place a proxy whose tight box has moved. Returns whether the tree changed.

Parameter	Type	Description
`leaf`	`number`
`box`	`Aabb`

A move entirely inside the fat box is free: the stored bounds still enclose the proxy, so no query can miss it. That is the whole point of the margin, and the reason it is a conservative enlargement rather than a tolerance.

`query`

query(box: Aabb, out: Int32Array): number

Fill out with every proxy id whose stored box overlaps box. Returns how many.

Parameter	Type	Description
`box`	`Aabb`
`out`	`Int32Array`