DeterministicSkipOctree
Related Docs:
trait DeterministicSkipOctree
| package data
Utility trait which elements the rightward search findPN.
A left tree node implementation provides more specialized child nodes
of type LeftChild.
A left tree node implementation provides more specialized child nodes
of type LeftChild. It furthermore defines a resolution method
findImmediateLeaf which is typically called after arriving here
from a findP0 call.
A common trait used in pattern matching, comprised of Leaf and LeftChildBranch.
A node is an object that can be stored in a orthant of a branch.
An inner non empty tree element has a mutable parent node.
A right tree node implementation provides more specialized child nodes
of type RightChild.
A right tree node implementation provides more specialized child nodes
of type RightChild. It furthermore defines the node in Qi-1 via the
prev method.
A common trait used in pattern matching, comprised of Leaf and RightChildBranch.
A transactional deterministic skip octree as outlined in the paper by Eppstein et al. It is constructed from a given space (dimensions) and a skip-gap parameter which determines the kind of skip list which is used to govern the level decimation.
The tree is a mutable data structure which supports lookup, insertion and removal in O(log n), as well as efficient range queries and nearest neighbour search.
The current implementation, backed by
impl.SkipOctreeImpl, uses the types of thegeompackage, assuming that coordinates are integers, with the maximum root hyper-cube given by a span from0to0x7FFFFFFF(e.g. inSpace.IntTwoDim, this isIntSquare( 0x40000000, 0x40000000, 0x40000000 ).