Struct Triangulation

pub struct Triangulation { /* private fields */ }

Triangulation

Uses the dD triangulation package from CGAL internally.

Implementations

impl Triangulation

pub fn new(dim: usize) -> Triangulation

Create new triangulation for vertices of size/dimension dim

pub fn add_vertex( &mut self, coords: &[f64], ) -> Result<usize, TriangulationError>

Add vertex to the triangulation.

The operation fails if coords has the wrong dimension.

pub unsafe fn add_vertex_unchecked(&mut self, coords: &[f64]) -> usize

Add vertex to triangulation without veryfing the dimension

Safety

If the dimension of coords is too small undefined behavior might be triggered on the c++ side. If the dimension of coords is too large only the first dim values will be considered.

pub fn convex_hull_cells(&mut self) -> CellIter<'_>

Returns a iterator over all convex hull cells/facets.

This allocates a vector with cell handles internally and is not implemented in the typical streaming fashion of rust iterators.

pub fn cells(&mut self) -> CellIter<'_>

Returns a iterator over all cells/facets of the triangulation.

This allocates a vector with cell handles internally and is not implemented in the typical streaming fashion of rust iterators.

Trait Implementations

impl Debug for Triangulation

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

Formats the value using the given formatter.

impl Drop for Triangulation

fn drop(&mut self)

Executes the destructor for this type.

impl PartialEq for Triangulation

fn eq(&self, other: &Triangulation) -> bool

Tests for self and other values to be equal, and is used by ==.

fn ne(&self, other: &Rhs) -> bool

Tests for !=. The default implementation is almost always sufficient, and should not be overridden without very good reason.

impl Eq for Triangulation

impl StructuralPartialEq for Triangulation