Struct ConflictGraph 

pub struct ConflictGraph {
    pub face_count: usize,
    pub face_to_points: Vec<Vec<usize>>,
    pub point_to_faces: Vec<Vec<usize>>,
}

A conflict graph recording which faces can “see” which points outside the hull.

Used in the full incremental QuickHull algorithm to speed up point insertion.

Fields

face_count: usize

Number of hull faces.

face_to_points: Vec<Vec<usize>>

For each face, list of point indices visible from that face.

point_to_faces: Vec<Vec<usize>>

For each point, list of face indices it can see.

Implementations

impl ConflictGraph

pub fn new(hull: &ConvexHull3DVec, points: &[Vec3]) -> Self

Build a conflict graph for hull against a set of points.

pub fn faces_for_point(&self, pi: usize) -> &[usize]

Returns the faces visible from point pi.

pub fn points_for_face(&self, fi: usize) -> &[usize]

Returns the points visible from face fi.