Struct startin::Triangulation

#[repr(C)]
pub struct Triangulation { /* fields omitted */ }

Implementations

impl Triangulation

pub fn new() -> Triangulation

pub fn set_snap_tolerance(&mut self, snaptol: f64) -> f64

Set a snap tolerance when inserting new points: if the newly inserted one is closer than snap_tolerance to another one, then it is not inserted. Avoids having very close vertices (like at 0.00007mm) Default is 0.001unit (thus 1mm for most datasets).

pub fn get_snap_tolerance(&self) -> f64

pub fn set_jump_and_walk(&mut self, b: bool)

Activate/deactive the jump-and-walk strategy for locate(). If deactivated, then the walk starts from the last inserted triangle.

pub fn is_using_robust_predicates(&self) -> bool

pub fn use_robust_predicates(&mut self, b: bool)

pub fn insert(&mut self, pts: &Vec<Vec<f64>>)

pub fn insert_one_pt(
    &mut self,
    px: f64,
    py: f64,
    pz: f64
) -> Result<usize, usize>

pub fn get_point(&self, v: usize) -> Option<Vec<f64>>

Returns the coordinates of the vertex v in a Vec [x,y,z]

pub fn adjacent_triangles_to_triangle(
    &self,
    tr: &Triangle
) -> Option<Vec<Triangle>>

pub fn incident_triangles_to_vertex(&self, v: usize) -> Option<Vec<Triangle>>

Returns a Vec of Triangles (finite + infinite) to the vertex v. If v doesn’t exist, then None is returned.

pub fn degree(&self, v: usize) -> Option<usize>

Returns the degree of a vertex, None is it doesn’t exist.

pub fn adjacent_vertices_to_vertex(&self, v: usize) -> Option<Vec<usize>>

Returns a list (Vec<usize>) (ordered CCW) of the adjacent vertices. None if the vertex is not part of the triangulation.

pub fn is_triangle(&self, tr: &Triangle) -> bool

Returns whether a triplet of indices is a Triangle in the triangulation.

pub fn statistics_degree(&self) -> (f64, usize, usize)

pub fn number_of_vertices(&self) -> usize

Returns number of finite vertices in the triangulation.

pub fn number_of_triangles(&self) -> usize

Returns number of finite triangles in the triangulation.

pub fn number_of_removed_vertices(&self) -> usize

Returns the number of vertices which are marked as “removed”

pub fn is_vertex_removed(&self, v: usize) -> bool

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

Returns the convex hull of the dataset, oriented CCW. It is a list of vertex indices (first != last)

pub fn number_of_vertices_on_convex_hull(&self) -> usize

Returns the size (ie the number of vertices) of the convex hull of the dataset

pub fn is_vertex_convex_hull(&self, v: usize) -> bool

Returns true if the vertex v is part of the boundary of the convex hull of the dataset. False otherwise.

pub fn locate(&self, px: f64, py: f64) -> Option<Triangle>

Returns, if it exists, the Triangle containing (px,py). If it is direction on a vertex/edge, then one is randomly chosen.

pub fn closest_point(&self, px: f64, py: f64) -> Option<usize>

pub fn all_vertices(&self) -> Vec<Vec<f64>>

Returns a Vec<Vec> of all the vertices (including the infinite one)

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

Returns a <Vec of all the finite edges (implicitly grouped by 2)

pub fn all_triangles(&self) -> Vec<Triangle>

Returns a <Vec of all the finite triangles

pub fn is_valid(&self) -> bool

Validates the Delaunay triangulation: (1) checks each triangle against each vertex (circumcircle tests); very slow (2) checks whether the convex hull is really convex

pub fn remove(&mut self, v: usize) -> Result<usize, &'static str>

pub fn write_obj(&self, path: String, twod: bool) -> Result<()>

write an OBJ file to disk

pub fn write_geojson(&self, path: String) -> Result<()>

write a GeoJSON file of the triangles/vertices to disk

pub fn printme(&self, withxyz: bool) -> String

pub fn voronoi_cell_area_ch_add_bound(
    &self,
    v: usize,
    newc1: &mut [f64],
    newc2: &mut [f64]
) -> Option<f64>

pub fn voronoi_cell_area_ch_use_bound(
    &self,
    v: usize,
    newc1: &[f64],
    newc2: &[f64]
) -> Option<f64>

pub fn voronoi_cell_area(&self, v: usize) -> Option<f64>

pub fn interpolate_nn(&self, px: f64, py: f64) -> Option<f64>

Interpolation: nearest/closest neighbour None if outside the convex hull, other the value

pub fn interpolate_tin_linear(&self, px: f64, py: f64) -> Option<f64>

Interpolation: linear in TIN None if outside the convex hull, other the value

pub fn interpolate_nni(&mut self, px: f64, py: f64) -> Option<f64>

Interpolation with natural neighbour interpolation (nni)

pub fn interpolate_laplace(&mut self, px: f64, py: f64) -> Option<f64>

Interpolation with Laplace (http://dilbert.engr.ucdavis.edu/~suku/nem/index.html) (variation of nni with distances instead of stolen areas; faster in practice) None if outside the convex hull, other the value

Trait Implementations

impl Display for Triangulation

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

Formats the value using the given formatter.