Struct PyConvexHull 

pub struct PyConvexHull {
    pub vertices: Vec<[f64; 3]>,
    pub faces: Vec<usize>,
}

A convex hull computed from a point cloud.

Uses a simplified incremental approach for demonstration purposes.

Fields

vertices: Vec<[f64; 3]>

Vertices of the convex hull.

faces: Vec<usize>

Triangle face indices (groups of 3).

Implementations

impl PyConvexHull

pub fn from_points(points: &[[f64; 3]]) -> Self

Compute a convex hull from a set of points.

This is a simplified implementation — for production use a full Quickhull algorithm.

pub fn volume(&self) -> f64

Approximate volume of the convex hull.

pub fn surface_area(&self) -> f64

Approximate surface area of the convex hull.

pub fn gjk_overlap(&self, other: &PyConvexHull) -> bool

Test whether two convex hulls overlap using a simplified GJK-like check (bounding-sphere test as approximation).

Trait Implementations

impl Clone for PyConvexHull

fn clone(&self) -> PyConvexHull

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for PyConvexHull

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

Formats the value using the given formatter.

impl<'de> Deserialize<'de> for PyConvexHull

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

where __D: Deserializer<'de>,

Deserialize this value from the given Serde deserializer.

impl Serialize for PyConvexHull

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

where __S: Serializer,

Serialize this value into the given Serde serializer.