Struct PointIndex 

pub struct PointIndex { /* private fields */ }

A k-d tree over points, split at the median of each cell’s widest axis.

Holds its own copy of the points.

Implementations

impl PointIndex

pub fn build(points: &[Point]) -> OgeomResult<Self>

Build the tree over a cloud.

Errors

OgeomError::Numeric if a point is not finite, and OgeomError::Range for a cloud of more than four billion points.

pub fn len(&self) -> usize

How many points the tree holds.

pub fn is_empty(&self) -> bool

Whether the tree holds no point.

pub fn points(&self) -> Vec<Point>

The points the tree was built over, in their cloud order.

pub fn nearest(&self, p: Point, max: f64) -> Option<Neighbour>

The point nearest p, no farther than max; the lowest index among equally near ones. max may be infinite.

pub fn nearest_many(&self, points: &[Point], max: f64) -> Vec<Option<Neighbour>>

PointIndex::nearest for each point, in parallel, answers in point order.

pub fn k_nearest(&self, p: Point, k: usize, max: f64) -> Vec<Neighbour>

The k points nearest p no farther than max, nearest first, ties in index order: fewer where fewer are that near.

pub fn within_ball(&self, centre: Point, radius: f64) -> Vec<u32>

Every point within radius of centre, in index order.

Trait Implementations

impl Clone for PointIndex

fn clone(&self) -> Self

Returns a duplicate of the value.

fn clone_from(&mut self, source: &Self)

Performs copy-assignment from source.

impl Debug for PointIndex

fn fmt(&self, f: &mut Formatter<'_>) -> Result

Formats the value using the given formatter.