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

extern crate startin;

fn main() {
    let mut dt = startin::Triangulation::new();
    dt.set_jump_and_walk(false);

    let _re = dt.insert_one_pt(1.1, 1.07, 12.5);
    let _re = dt.insert_one_pt(11.0, 1.02, 7.65);
    let _re = dt.insert_one_pt(11.05, 11.1, 33.0);
    let _re = dt.insert_one_pt(1.0, 11.0, 21.0);

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

    // let c = dt.closest_point(11.0, 11.0);
    // let re = dt.remove(c.unwrap());
    let re = dt.remove(3);
    if re.is_err() == true {
        println!("!!!Error: {:?}", re.unwrap_err());
    }

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

    let _re = dt.insert_one_pt(11.0, 11.0, 22.2);

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

    println!("{:?}", dt.all_finite_edges());
}