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
use crate::{
primitives::{Arc, Line},
Angle,
};
use euclid::Point2D;
use std::{
iter,
iter::{Chain, Once},
};
pub trait Approximate<Space> {
type Iter: Iterator<Item = Point2D<f64, Space>>;
fn approximate(&self, tolerance: f64) -> Self::Iter;
}
impl<'a, Space, A: Approximate<Space> + ?Sized> Approximate<Space> for &'a A {
type Iter = A::Iter;
fn approximate(&self, tolerance: f64) -> Self::Iter {
(*self).approximate(tolerance)
}
}
impl<Space> Approximate<Space> for Point2D<f64, Space> {
type Iter = Once<Point2D<f64, Space>>;
fn approximate(&self, _tolerance: f64) -> Self::Iter {
std::iter::once(*self)
}
}
impl<Space> Approximate<Space> for Line<Space> {
type Iter = Chain<Once<Point2D<f64, Space>>, Once<Point2D<f64, Space>>>;
fn approximate(&self, _tolerance: f64) -> Self::Iter {
iter::once(self.start).chain(iter::once(self.end))
}
}
impl<Space> Approximate<Space> for Arc<Space> {
type Iter = ApproximatedArc<Space>;
fn approximate(&self, tolerance: f64) -> Self::Iter {
let (steps, delta) = if tolerance <= 0.0 || self.radius() <= tolerance {
(1, self.sweep_angle())
} else {
let cos_theta_on_two = 1.0 - tolerance / self.radius();
let theta = cos_theta_on_two.acos() * 2.0;
let line_segment_count = self.sweep_angle().get() / theta;
let line_segment_count = f64::max(line_segment_count, 2.0);
let actual_step = self.sweep_angle() / line_segment_count;
(line_segment_count.ceil().abs() as usize, actual_step)
};
ApproximatedArc {
i: 0,
steps,
step_size: delta,
arc: *self,
}
}
}
#[derive(Debug, Clone)]
#[allow(missing_copy_implementations)]
pub struct ApproximatedArc<Space> {
i: usize,
steps: usize,
step_size: Angle,
arc: Arc<Space>,
}
impl<Space> Iterator for ApproximatedArc<Space> {
type Item = Point2D<f64, Space>;
fn next(&mut self) -> Option<Self::Item> {
if self.i > self.steps {
return None;
}
let angle = Angle::radians(self.i as f64 * self.step_size.radians);
let point = self.arc.point_at(angle);
self.i += 1;
Some(point)
}
}
#[cfg(test)]
mod tests {
use super::*;
type Point = euclid::default::Point2D<f64>;
#[test]
fn approximate_arc_with_points() {
let arc = Arc::from_centre_radius(
Point::zero(),
100.0,
Angle::zero(),
Angle::frac_pi_2(),
);
let quality = 10.0;
let pieces: Vec<_> = arc.approximate(quality).collect();
for &piece in &pieces {
let error = arc.radius() - (piece - arc.centre()).length();
assert!(error < quality);
}
assert_eq!(arc.start(), *pieces.first().unwrap());
assert_eq!(arc.end(), *pieces.last().unwrap());
}
}