Struct de_pathing::finder::GraphTriangle

struct GraphTriangle {
    triangle: Triangle,
    triangle_id: u32,
    edges: [u32; 3],
}

A triangle used for spatial indexing inside the edge visibility graph.

Fields

triangle: Triangle

triangle_id: u32

edges: [u32; 3]

IDs of edges of the triangle. These correspond to edges AB, BC and CA respectively.

Implementations

impl GraphTriangle

fn new(triangle: Triangle, triangle_id: u32, edges: [u32; 3]) -> Self

fn triangle_id(&self) -> u32

fn neighbours(&self, point: Point<f32>) -> ArrayVec<[u32; 3]>

Returns (up to 3) IDs of the triangle edges excluding edges which include point.

Trait Implementations

impl PointDistance for GraphTriangle

fn distance_2(&self, point: &[f32; 2]) -> f32

Returns the squared euclidean distance between an object to a point.

fn contains_point(&self, point: &[f32; 2]) -> bool

Returns true if a point is contained within this object.

fn distance_2_if_less_or_equal( &self, point: &<Self::Envelope as Envelope>::Point, max_distance_2: <<Self::Envelope as Envelope>::Point as Point>::Scalar ) -> Option<<<Self::Envelope as Envelope>::Point as Point>::Scalar>

Returns the squared distance to this object, or None if the distance is larger than a given maximum value.

impl RTreeObject for GraphTriangle

type Envelope = AABB<[f32; 2]>

The object’s envelope type. Usually, [AABB] will be the right choice. This type also defines the object’s dimensionality.

fn envelope(&self) -> Self::Envelope

Returns the object’s envelope.