Struct AABB 

pub struct AABB<P>
where
    P: Point,
{ /* private fields */ }

Axis-aligned bounding box for spatial queries. An n-dimensional axis aligned bounding box (AABB).

An object’s AABB is the smallest box totally encompassing an object while being aligned to the current coordinate system. Although these structures are commonly called bounding boxes, they exist in any dimension.

Note that AABBs cannot be inserted into r-trees. Use the Rectangle struct for this purpose.

Type arguments

P: The struct is generic over which point type is used. Using an n-dimensional point type will result in an n-dimensional bounding box.

Implementations

impl<P> AABB<P>

where P: Point,

pub fn from_point(p: P) -> AABB<P>

Returns the AABB encompassing a single point.

pub fn lower(&self) -> P

Returns the AABB’s lower corner.

This is the point contained within the AABB with the smallest coordinate value in each dimension.

pub fn upper(&self) -> P

Returns the AABB’s upper corner.

This is the point contained within the AABB with the largest coordinate value in each dimension.

pub fn from_corners(p1: P, p2: P) -> AABB<P>

Creates a new AABB encompassing two points.

pub fn from_points<'a, I>(i: I) -> AABB<P>

where I: IntoIterator<Item = &'a P> + 'a, P: 'a,

Creates a new AABB encompassing a collection of points.

pub fn min_point(&self, point: &P) -> P

Returns the point within this AABB closest to a given point.

If point is contained within the AABB, point will be returned.

pub fn distance_2(&self, point: &P) -> <P as Point>::Scalar

Returns the squared distance to the AABB’s min_point

Trait Implementations

impl<P> Clone for AABB<P>

where P: Clone + Point,

fn clone(&self) -> AABB<P>

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl<P> Debug for AABB<P>

where P: Debug + Point,

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

Formats the value using the given formatter.

impl<P> Envelope for AABB<P>

where P: Point,

type Point = P

The envelope’s point type.

fn new_empty() -> AABB<P>

Creates a new, empty envelope that does not encompass any child.

fn contains_point(&self, point: &P) -> bool

Returns true if a point is contained within this envelope.

fn contains_envelope(&self, other: &AABB<P>) -> bool

Returns true if another envelope is fully contained within self.

fn merge(&mut self, other: &AABB<P>)

Extends self to contain another envelope.

fn merged(&self, other: &AABB<P>) -> AABB<P>

Returns the minimal envelope containing self and another envelope.

fn intersects(&self, other: &AABB<P>) -> bool

Returns true if self and other intersect. The intersection might be of zero area (the two envelopes only touching each other).

fn area(&self) -> <P as Point>::Scalar

Returns this envelope’s area. Must be at least 0.

fn distance_2(&self, point: &P) -> <P as Point>::Scalar

Returns the squared distance between the envelope’s border and a point.

fn min_max_dist_2(&self, point: &P) -> <P as Point>::Scalar

Returns the squared min-max distance, a concept that helps to find nearest neighbors efficiently.

fn center(&self) -> <AABB<P> as Envelope>::Point

Returns the envelope’s center point.

fn intersection_area( &self, other: &AABB<P>, ) -> <<AABB<P> as Envelope>::Point as Point>::Scalar

Returns the area of the intersection of self and another envelope.

fn perimeter_value(&self) -> <P as Point>::Scalar

Returns a value proportional to the envelope’s perimeter.

fn sort_envelopes<T>(axis: usize, envelopes: &mut [T])

where T: RTreeObject<Envelope = AABB<P>>,

Sorts a given set of objects with envelopes along one of their axes.

fn partition_envelopes<T>( axis: usize, envelopes: &mut [T], selection_size: usize, )

where T: RTreeObject<Envelope = AABB<P>>,

Partitions objects with an envelope along a certain axis.

impl<P> Hash for AABB<P>

where P: Hash + Point,

fn hash<__H>(&self, state: &mut __H)

where __H: Hasher,

Feeds this value into the given Hasher.

fn hash_slice<H>(data: &[Self], state: &mut H)

where H: Hasher, Self: Sized,

Feeds a slice of this type into the given Hasher.

impl<P> Ord for AABB<P>

where P: Ord + Point,

fn cmp(&self, other: &AABB<P>) -> Ordering

This method returns an Ordering between self and other.

fn max(self, other: Self) -> Self

where Self: Sized,

Compares and returns the maximum of two values.

fn min(self, other: Self) -> Self

where Self: Sized,

Compares and returns the minimum of two values.

fn clamp(self, min: Self, max: Self) -> Self

where Self: Sized,

Restrict a value to a certain interval.

impl<P> PartialEq for AABB<P>

where P: PartialEq + Point,

fn eq(&self, other: &AABB<P>) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl<P> PartialOrd for AABB<P>

where P: PartialOrd + Point,

fn partial_cmp(&self, other: &AABB<P>) -> Option<Ordering>

This method returns an ordering between self and other values if one exists.

fn lt(&self, other: &Rhs) -> bool

Tests less than (for self and other) and is used by the < operator.

fn le(&self, other: &Rhs) -> bool

Tests less than or equal to (for self and other) and is used by the <= operator.

fn gt(&self, other: &Rhs) -> bool

Tests greater than (for self and other) and is used by the > operator.

fn ge(&self, other: &Rhs) -> bool

Tests greater than or equal to (for self and other) and is used by the >= operator.

impl<P> Copy for AABB<P>

where P: Copy + Point,

impl<P> Eq for AABB<P>

where P: Eq + Point,

impl<P> StructuralPartialEq for AABB<P>

where P: Point,