Struct KirkpatrickHierarchy 

pub struct KirkpatrickHierarchy { /* private fields */ }

Kirkpatrick point-location hierarchy.

Build with KirkpatrickHierarchy::build, query with KirkpatrickHierarchy::locate.

Implementations

impl KirkpatrickHierarchy

pub fn build( vertices: &[Point2], triangles: &[[usize; 3]], face_labels: &[usize], ) -> Result<Self, KirkpatrickError>

Build a Kirkpatrick hierarchy from a triangulation.

vertices — the vertex positions. triangles — list of CCW triangles as vertex index triples. face_labels — the original face index for each triangle (use 0..triangles.len() if you just want the triangle index).

The triangulation must cover a simply-connected region (no holes). A bounding triangle is added automatically to enclose everything.

pub fn locate(&self, query: Point2) -> Result<Option<usize>, KirkpatrickError>

Locate a query point in the hierarchy.

Returns the face label of the containing triangle at the finest level, or None if the point is in an exterior face (face label usize::MAX). Returns an error if the point is outside the bounding triangle.

pub fn num_levels(&self) -> usize

Number of levels in the hierarchy.

pub fn num_finest_triangles(&self) -> usize

Number of triangles at the finest level.

pub fn num_coarsest_triangles(&self) -> usize

Number of triangles at the coarsest level.

pub fn locate_brute_force(&self, query: Point2) -> Option<usize>

Brute-force locate: scan all triangles at the finest level. Used as an oracle for testing.

Trait Implementations

impl Debug for KirkpatrickHierarchy

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

Formats the value using the given formatter.