Struct startin::Triangulation

pub struct Triangulation { /* fields omitted */ }

Methods

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_one_pt(
    &mut self,
    px: f64,
    py: f64,
    pz: f64
) -> Result<usize, usize>

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

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

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

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

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

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 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 size 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 all_vertices(&self) -> Vec<Vec<f64>>

Returns a Vec<Vec> of all the finite vertices

pub fn is_valid(&self) -> bool

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

Trait Implementations

impl Display for Triangulation

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

Formats the value using the given formatter.