triangulate 0.2.0

Subdivides polygons into equivalent triangles
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
49
50
51
52
53
54

use std::fs;

use crate::{formats, Polygon, PolygonList, ListFormat};

use super::util;

#[test]
fn triangulate() {
    for polygon in util::polygon::all() {
        polygon.triangulate(formats::IndexedFanFormat::new(&mut Vec::<Vec<_>>::new())).expect("Triangulation failed");
    }
}

#[test]
fn triangulate_hollow() {
    let polygon = vec![
        vec![[0f32, 0f32], [0., 1.], [1., 1.], [1., 0.]], 
        vec![[0.05, 0.05], [0.05, 0.95], [0.95, 0.95], [0.95, 0.05]]
    ];
    polygon.triangulate(formats::IndexedFanFormat::new(&mut Vec::<Vec<_>>::new())).expect("Triangulation failed");
}

#[test]
fn triangulate_geography() {
    for file in fs::read_dir(util::countries_path()).unwrap() {
        let file = file.unwrap();
        let polygon_list = util::load_polygon_list(file.path().to_str().unwrap()).unwrap();
        // A few countries have a lot of vertices, so for the sake of time, skip those
        if polygon_list.vertex_count() <= 4000 {
            polygon_list.triangulate(formats::IndexedFanFormat::new(&mut Vec::<Vec<_>>::new())).expect("Triangulation failed");
            println!("'{}' completed", file.file_name().to_str().unwrap());
        }
    }
}

#[test]
fn regular_polygons() {
    for n in 3..=500 {
        let mut p = Vec::new();
        for nn in 0..n {
            let scalar = 100.;

            let theta = std::f64::consts::PI * 2. * (nn as f64) / (n as f64);
            let (x, y) = theta.sin_cos();
            let v = [x * scalar, y * scalar];
            p.push(v);
        }

        let mut output = Vec::<usize>::new();
        let format = formats::IndexedListFormat::new(&mut output).into_fan_format();
        p.triangulate(format).expect("Triangulation failed");
        std::hint::black_box(output);
    }
}