Trait rstar::Envelope [−][src]
pub trait Envelope: Clone + Copy + PartialEq + Debug {
type Point: Point;
Show 14 methods
fn new_empty() -> Self;
fn contains_point(&self, point: &Self::Point) -> bool;
fn contains_envelope(&self, aabb: &Self) -> bool;
fn merge(&mut self, other: &Self);
fn merged(&self, other: &Self) -> Self;
fn intersects(&self, other: &Self) -> bool;
fn intersection_area(&self, other: &Self) -> <Self::Point as Point>::Scalar;
fn area(&self) -> <Self::Point as Point>::Scalar;
fn distance_2(&self, point: &Self::Point) -> <Self::Point as Point>::Scalar;
fn min_max_dist_2(
&self,
point: &Self::Point
) -> <Self::Point as Point>::Scalar;
fn center(&self) -> Self::Point;
fn perimeter_value(&self) -> <Self::Point as Point>::Scalar;
fn sort_envelopes<T: RTreeObject<Envelope = Self>>(
axis: usize,
envelopes: &mut [T]
);
fn partition_envelopes<T: RTreeObject<Envelope = Self>>(
axis: usize,
envelopes: &mut [T],
selection_size: usize
);
}
Expand description
An envelope type that encompasses some child nodes.
An envelope defines how different bounding boxes of inserted children in an r-tree can interact, e.g. how they can be merged or intersected. This trait is not meant to be implemented by the user. Currently, only one implementation exists (AABB) and should be used.
Associated Types
Required methods
fn contains_point(&self, point: &Self::Point) -> bool
fn contains_point(&self, point: &Self::Point) -> bool
Returns true if a point is contained within this envelope.
fn contains_envelope(&self, aabb: &Self) -> bool
fn contains_envelope(&self, aabb: &Self) -> bool
Returns true if another envelope is fully contained within self
.
Returns the minimal envelope containing self
and another envelope.
fn intersects(&self, other: &Self) -> bool
fn intersects(&self, other: &Self) -> bool
Sets self
to the intersection of self
and another envelope.
Returns the area of the intersection of self
and another envelope.
Returns this envelope’s area. Must be at least 0.
Returns the euclidean distance to the envelope’s border.
Returns the squared min-max distance, a concept that helps to find nearest neighbors efficiently.
Visually, if an AABB and a point are given, the min-max distance returns the distance at which we surely know an element must be present. This serves as an upper bound during nearest neighbor search.
References
Roussopoulos, Nick, Stephen Kelley, and Frédéric Vincent. “Nearest neighbor queries.” ACM sigmod record. Vol. 24. No. 2. ACM, 1995.
fn perimeter_value(&self) -> <Self::Point as Point>::Scalar
fn perimeter_value(&self) -> <Self::Point as Point>::Scalar
Returns a value proportional to the envelope’s perimeter.
fn sort_envelopes<T: RTreeObject<Envelope = Self>>(
axis: usize,
envelopes: &mut [T]
)
fn sort_envelopes<T: RTreeObject<Envelope = Self>>(
axis: usize,
envelopes: &mut [T]
)
Sorts a given set of objects with envelopes along one of their axis.
fn partition_envelopes<T: RTreeObject<Envelope = Self>>(
axis: usize,
envelopes: &mut [T],
selection_size: usize
)
fn partition_envelopes<T: RTreeObject<Envelope = Self>>(
axis: usize,
envelopes: &mut [T],
selection_size: usize
)
Partitions objects with an envelopes along a certain axis.
After calling this, envelopes[0..selection_size] are all smaller than envelopes[selection_size + 1..].