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
48

extern crate startin;

fn main() {
    let mut pts: Vec<[f64; 3]> = Vec::new();
    pts.push([0.0, 0.0, 12.5]);
    pts.push([1.0, 0.0, 7.65]);
    pts.push([1.1, 1.1, 33.0]);
    pts.push([0.0, 1.0, 33.0]);
    pts.push([0.5, 0.9, 33.0]);
    pts.push([0.9, 0.5, 33.0]);
    pts.push([0.67, 0.66, 33.0]);
    let mut dt = startin::Triangulation::new();
    dt.set_jump_and_walk(false);
    dt.insert(&pts, startin::InsertionStrategy::AsIs);
    println!("{}", dt.printme(true));

    // let _re = dt.remove(3);
    // println!("{}", dt.printme(true));

    println!("is 3 removed {:?}", dt.is_vertex_removed(3));
    // dt.insert_one_pt(1.1, 2.2, 3.3);
    // println!("is 3 removed {}", dt.is_vertex_removed(3));
    // println!("is 4 removed {}", dt.is_vertex_removed(4));

    assert!(dt.is_valid());

    let a = dt.get_point(3);
    if a.is_ok() == true {
        println!("point {:?}", a.unwrap());
    }

    let re = dt.locate(50.0, 50.0);
    match re {
        Ok(x) => println!("Triangle: {}", x),
        Err(why) => println!("{:?}", why),
    }

    let re = dt.closest_point(1.1, 1.11);
    match re {
        Ok(x) => println!("Point: {}", x),
        Err(why) => println!("{:?}", why),
    }

    // let _re = dt.insert_one_pt(1.5, 1.5, 33.0);
    // println!("{}", dt.printme(true));
    // assert!(dt.is_valid());
    // dt.write_obj("/Users/hugo/temp/0.obj".to_string(), true);
}