collision 0.20.1

A collision extension to cgmath
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
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152

#![feature(test)]

extern crate cgmath;
extern crate collision;
extern crate rand;
extern crate test;

use cgmath::{Point2, Vector2};
use cgmath::prelude::*;
use collision::{Aabb2, Ray2};
use collision::dbvt::*;
use collision::prelude::*;
use rand::Rng;
use test::Bencher;

#[derive(Debug, Clone)]
struct Value {
    pub id: u32,
    pub aabb: Aabb2<f32>,
    fat_aabb: Aabb2<f32>,
}

impl Value {
    pub fn new(id: u32, aabb: Aabb2<f32>) -> Self {
        Self {
            id,
            fat_aabb: aabb.add_margin(Vector2::new(0., 0.)),
            aabb,
        }
    }
}

impl TreeValue for Value {
    type Bound = Aabb2<f32>;

    fn bound(&self) -> &Aabb2<f32> {
        &self.aabb
    }

    fn get_bound_with_margin(&self) -> Aabb2<f32> {
        self.fat_aabb
    }
}

#[bench]
fn benchmark_insert(b: &mut Bencher) {
    let mut rng = rand::thread_rng();
    let mut tree = DynamicBoundingVolumeTree::<Value>::new();
    let mut i = 0;
    b.iter(|| {
        let offset = rng.gen_range(0., 100.);
        tree.insert(Value::new(
            i,
            aabb2(offset + 2., offset + 2., offset + 4., offset + 4.),
        ));
        i += 1;
    });
}

#[bench]
fn benchmark_do_refit(b: &mut Bencher) {
    let mut rng = rand::thread_rng();
    let mut tree = DynamicBoundingVolumeTree::<Value>::new();
    let mut i = 0;
    b.iter(|| {
        let offset = rng.gen_range(0., 100.);
        tree.insert(Value::new(
            i,
            aabb2(offset + 2., offset + 2., offset + 4., offset + 4.),
        ));
        tree.do_refit();
        i += 1;
    });
}

#[bench]
fn benchmark_query(b: &mut Bencher) {
    let mut rng = rand::thread_rng();
    let mut tree = DynamicBoundingVolumeTree::<Value>::new();
    for i in 0..100000 {
        let neg_y = if rng.gen::<bool>() { -1. } else { 1. };
        let neg_x = if rng.gen::<bool>() { -1. } else { 1. };
        let offset_x = neg_x * rng.gen_range(9000., 10000.);
        let offset_y = neg_y * rng.gen_range(9000., 10000.);
        tree.insert(Value::new(
            i,
            aabb2(offset_x + 2., offset_y + 2., offset_x + 4., offset_y + 4.),
        ));
        tree.tick();
    }

    let rays: Vec<Ray2<f32>> = (0..1000)
        .map(|_| {
            let p = Point2::new(
                rng.gen_range(-10000., 10000.),
                rng.gen_range(-10000., 10000.),
            );
            let d = Vector2::new(rng.gen_range(-1., 1.), rng.gen_range(-1., 1.)).normalize();
            Ray2::new(p, d)
        })
        .collect();

    let mut visitors: Vec<DiscreteVisitor<Ray2<f32>, Value>> = rays.iter()
        .map(|ray| DiscreteVisitor::<Ray2<f32>, Value>::new(ray))
        .collect();

    let mut i = 0;

    b.iter(|| {
        tree.query(&mut visitors[i % 1000]).len();
        i += 1;
    });
}

#[bench]
fn benchmark_ray_closest_query(b: &mut Bencher) {
    let mut rng = rand::thread_rng();
    let mut tree = DynamicBoundingVolumeTree::<Value>::new();
    for i in 0..100000 {
        let neg_y = if rng.gen::<bool>() { -1. } else { 1. };
        let neg_x = if rng.gen::<bool>() { -1. } else { 1. };
        let offset_x = neg_x * rng.gen_range(9000., 10000.);
        let offset_y = neg_y * rng.gen_range(9000., 10000.);
        tree.insert(Value::new(
            i,
            aabb2(offset_x + 2., offset_y + 2., offset_x + 4., offset_y + 4.),
        ));
        tree.tick();
    }

    let rays: Vec<Ray2<f32>> = (0..1000)
        .map(|_| {
            let p = Point2::new(
                rng.gen_range(-10000., 10000.),
                rng.gen_range(-10000., 10000.),
            );
            let d = Vector2::new(rng.gen_range(-1., 1.), rng.gen_range(-1., 1.)).normalize();
            Ray2::new(p, d)
        })
        .collect();

    let mut i = 0;

    b.iter(|| {
        query_ray_closest(&tree, rays[i % 1000]);
        i += 1;
    });
}

fn aabb2(minx: f32, miny: f32, maxx: f32, maxy: f32) -> Aabb2<f32> {
    Aabb2::new(Point2::new(minx, miny), Point2::new(maxx, maxy))
}