Struct BoundingBox 

pub struct BoundingBox {
    pub points: Vec<Point>,
}

A bounding box represented by a collection of points.

Fields

points: Vec<Point>

The points that define the bounding box.

Implementations

impl BoundingBox

pub fn new(points: Vec<Point>) -> Self

Creates a new bounding box from a vector of points.

Arguments

• points - A vector of points that define the bounding box.

Returns

A new BoundingBox instance.

pub fn from_coords(x1: f32, y1: f32, x2: f32, y2: f32) -> Self

Creates a bounding box from coordinates.

Arguments

• x1 - The x-coordinate of the top-left corner.
• y1 - The y-coordinate of the top-left corner.
• x2 - The x-coordinate of the bottom-right corner.
• y2 - The y-coordinate of the bottom-right corner.

Returns

A new BoundingBox instance representing a rectangle.

pub fn from_contour(contour: &Contour<u32>) -> Self

Creates a bounding box from a contour.

Arguments

• contour - A reference to a contour from imageproc.

Returns

A new BoundingBox instance with points converted from the contour.

pub fn area(&self) -> f32

Calculates the area of the bounding box using the shoelace formula.

Returns

The area of the bounding box. Returns 0.0 if the bounding box has fewer than 3 points.

pub fn perimeter(&self) -> f32

Calculates the perimeter of the bounding box.

Returns

The perimeter of the bounding box.

pub fn x_min(&self) -> f32

Gets the minimum x-coordinate of all points in the bounding box.

Returns

The minimum x-coordinate, or 0.0 if there are no points.

pub fn y_min(&self) -> f32

Gets the minimum y-coordinate of all points in the bounding box.

Returns

The minimum y-coordinate, or 0.0 if there are no points.

pub fn get_min_area_rect(&self) -> MinAreaRect

Computes the minimum area rectangle that encloses the bounding box.

This method uses the rotating calipers algorithm on the convex hull of the bounding box to find the minimum area rectangle.

Returns

A MinAreaRect representing the minimum area rectangle. If the bounding box has fewer than 3 points, returns a rectangle with zero dimensions.

pub fn approx_poly_dp(&self, epsilon: f32) -> BoundingBox

Approximates a polygon using the Douglas-Peucker algorithm.

Arguments

• epsilon - The maximum distance between the original curve and the simplified curve.

Returns

A new BoundingBox with simplified points. If the bounding box has 2 or fewer points, returns a clone of the original bounding box.

Trait Implementations

impl Clone for BoundingBox

fn clone(&self) -> BoundingBox

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for BoundingBox

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for BoundingBox

fn deserialize<__D>(__deserializer: __D) -> Result<Self, __D::Error>

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for BoundingBox

fn serialize<__S>(&self, __serializer: __S) -> Result<__S::Ok, __S::Error>

where __S: Serializer,

Serialize this value into the given Serde serializer.