Skip to main content

minimum_rotated_rect

geometry_algorithm::minimum_rotated_rect

Function minimum_rotated_rect 

Source 
pub fn minimum_rotated_rect<G, P>(geometry: &G) -> Polygon<P>
where
    P: Point<Scalar = f64> + PointMut + Default + Copy,
    MonotoneChain: ConvexHullStrategy<G, Output = Ring<P, true, true>>,
Expand description

Compute the minimum-area rotated rectangle enclosing geometry.

This is Cartesian-only through the convex-hull strategy bound. Empty input returns an empty polygon; one- and two-point inputs return a closed, zero-area degenerate rectangle.