visioncortex 0.9.1

Semantic Computer Vision
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

use crate::polypartition::PartitionVertex;

use super::{is_convex, is_inside, is_reflex, normalize, point_f64_approximately};

pub fn update_vertex_reflexity(v: usize, vertices: &mut Vec<PartitionVertex>) {
    let v1 = vertices[v].previous;
    let v3 = vertices[v].next;
    let v1_info = &vertices[v1].info;
    let v3_info = &vertices[v3].info;
    vertices[v].info.is_convex = !is_reflex(&v1_info.p, &vertices[v].info.p, &v3_info.p);
}

pub fn update_vertex(v: usize, vertices: &mut Vec<PartitionVertex>) {
    let v1 = vertices[v].previous;
    let v3 = vertices[v].next;
    let v1_info = &vertices[v1].get_info();
    let v3_info = &vertices[v3].get_info();
    let v_info = vertices[v].get_info();
    vertices[v].info.is_convex = is_convex(&v1_info.p, &v_info.p, &v3_info.p);

    let vec1 = normalize(&(v1_info.p - v_info.p));
    let vec3 = normalize(&(v3_info.p - v_info.p));
    //console_log_util(format!("{:?}\n{:?}", v1_info, v3_info));
    vertices[v].info.angle = vec1.x * vec3.x + vec1.y * vec3.y;

    if vertices[v].info.is_convex {
        vertices[v].info.is_ear = true;
        for vertex in vertices.iter() {
            let vertex_info = vertex.get_info();
            if point_f64_approximately(vertex_info.p, v_info.p) {
              continue;
            }
            if point_f64_approximately(vertex_info.p, v1_info.p) {
              continue;
            }
            if point_f64_approximately(vertex_info.p, v3_info.p) {
              continue;
            }
            if is_inside(&v1_info.p, &v_info.p, &v3_info.p, &vertex_info.p) {
              vertices[v].info.is_ear = false;
              break;
            }
        }
    } else {
        vertices[v].info.is_ear = false;
    }
}