startin 0.8.3

A Delaunay triangulator for terrains.
Documentation 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47

extern crate startin;
use rand::prelude::*;

fn main() {
    let num_pts = 1000;
    let mut pts: Vec<[f64; 3]> = Vec::new();

    let mut rng = rand::thread_rng();
    for _i in 0..num_pts {
        let x: f64 = rng.gen();
        let y: f64 = rng.gen();
        pts.push([x * 100.0, y * 100.0, 2.0]);
    }

    let mut dt = startin::Triangulation::new();
    dt.set_jump_and_walk(false);
    dt.insert(&pts, startin::InsertionStrategy::AsIs);
    println!("{}", dt.printme(false));

    //-- delete 5 vertices on convex hull
    let mut total: usize = 0;
    loop {
        let j: usize = rng.gen_range(1, num_pts);
        if dt.is_vertex_convex_hull(j) == true {
            let re = dt.remove(j);
            if re.is_err() == true {
                println!("!!!Error: {:?}", re.unwrap_err());
            }
            total = total + 1;
            if total == 10 {
                break;
            }
        }
    }

    // //-- insert 50 vertices randomly
    // for _i in 0..50 {
    //     let x: f64 = rng.gen();
    //     let y: f64 = rng.gen();
    //     let _re = dt.insert_one_pt(x, y, 1.1);
    // }
    // println!("{}", dt.printme(false));

    println!("Is Delaunay?: {}", dt.is_valid());
    println!("# vertices {}", dt.number_of_vertices());
    println!("# triangles {}", dt.number_of_triangles());
}