Module crater::kdtree

Structs

• Iter
• IterMut
• KdTree
  A KD tree represents a collection of points in space, with the ability to answer distance related queries, mainly:
• QueryOptions
  Fine grained control over a query within the tree (KdTree::k_closest).

Enums

• QueryBound
  Represents an inner / outer limit for a query within the tree (KdTree::k_closest). See QueryOptions for more info