Struct Delaunay 

pub struct Delaunay { /* private fields */ }

Structure for storing and querying a Delaunay triangulation

The Delaunay triangulation of a set of points is a triangulation such that no point is inside the circumcircle of any triangle (in 2D) or circumsphere of any tetrahedron (in 3D).

This implementation uses the Qhull library (via qhull-rs) to compute Delaunay triangulations efficiently.

Implementations

impl Delaunay

pub fn new(points: &Array2<f64>) -> SpatialResult<Self>

Create a new Delaunay triangulation

Arguments

• points - The points to triangulate, shape (npoints, ndim)

Returns

• A new Delaunay triangulation or an error

Examples

use scirs2_spatial::delaunay::Delaunay;
use scirs2_core::ndarray::array;

let points = array![
    [0.0, 0.0],
    [1.0, 0.0],
    [0.0, 1.0],
    [1.0, 1.0]
];

let tri = Delaunay::new(&points).unwrap();
let simplices = tri.simplices();
println!("Triangles: {:?}", simplices);

pub fn new_constrained( points: &Array2<f64>, constraints: Vec<(usize, usize)>, ) -> SpatialResult<Self>

Create a new constrained Delaunay triangulation

Arguments

• points - The points to triangulate, shape (npoints, ndim)
• constraints - Vector of constraint edges, each edge is a pair of point indices

Returns

• A new constrained Delaunay triangulation or an error

Note

Currently only supports 2D constrained Delaunay triangulation. Constraints are edges that must be present in the final triangulation.

Examples

use scirs2_spatial::delaunay::Delaunay;
use scirs2_core::ndarray::array;

let points = array![
    [0.0, 0.0],
    [1.0, 0.0],
    [1.0, 1.0],
    [0.0, 1.0],
    [0.5, 0.5]
];

// Add constraint edges forming a square boundary
let constraints = vec![(0, 1), (1, 2), (2, 3), (3, 0)];

let tri = Delaunay::new_constrained(&points, constraints).unwrap();
let simplices = tri.simplices();
println!("Constrained triangles: {:?}", simplices);

pub fn constraints(&self) -> &[(usize, usize)]

Get the constraint edges

Returns

• Vector of constraint edges as pairs of point indices

pub fn npoints(&self) -> usize

Get the number of points

Returns

• Number of points in the triangulation

pub fn ndim(&self) -> usize

Get the dimension of the points

Returns

• Number of dimensions of the points

pub fn points(&self) -> &Array2<f64>

Get the points used for triangulation

Returns

• Array of points

pub fn simplices(&self) -> &[Vec<usize>]

Get the simplices (triangles in 2D, tetrahedra in 3D, etc.)

Returns

• Vector of simplices, where each simplex is a vector of vertex indices

pub fn neighbors(&self) -> &[Vec<i64>]

Get the neighbors of each simplex

Returns

• Vector of neighbor indices for each simplex

pub fn find_simplex(&self, point: &[f64]) -> Option<usize>

Find the simplex containing a given point

Arguments

• point - The point to locate

Returns

• The index of the simplex containing the point, or None if not found

Examples

use scirs2_spatial::delaunay::Delaunay;
use scirs2_core::ndarray::array;

let points = array![
    [0.0, 0.0],
    [1.0, 0.0],
    [0.0, 1.0],
    [1.0, 1.0]
];

let tri = Delaunay::new(&points).unwrap();
// Try to find which triangle contains the point [0.25, 0.25]
if let Some(idx) = tri.find_simplex(&[0.25, 0.25]) {
    println!("Point is in simplex {}", idx);
}

pub fn convex_hull(&self) -> Vec<usize>

Compute the convex hull of the points

Returns

• Indices of the points forming the convex hull

Examples

use scirs2_spatial::delaunay::Delaunay;
use scirs2_core::ndarray::array;

let points = array![
    [0.0, 0.0],
    [1.0, 0.0],
    [0.0, 1.0],
    [0.5, 0.5]  // Interior point
];

let tri = Delaunay::new(&points).unwrap();
let hull = tri.convex_hull();

// The hull should be the three corner points, excluding the interior point
assert_eq!(hull.len(), 3);

Trait Implementations

impl Clone for Delaunay

fn clone(&self) -> Self

Returns a duplicate of the value.

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

Performs copy-assignment from source.

impl Debug for Delaunay

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

Formats the value using the given formatter.