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
|
import unittest
from random import *
from svgelements import *
def get_random_cubic_bezier():
return CubicBezier((random() * 50, random() * 50), (random() * 50, random() * 50),
(random() * 50, random() * 50), (random() * 50, random() * 50))
class TestElementCubicBezierLength(unittest.TestCase):
def test_cubic_bezier_length(self):
n = 100
error = 0
for _ in range(n):
b = get_random_cubic_bezier()
l1 = b._length_scipy()
l2 = b._length_default(error=1e-6)
c = abs(l1 - l2)
error += c
self.assertAlmostEqual(l1, l2, places=1)
print("Average cubic-line error: %g" % (error / n))
class TestElementCubicBezierPoint(unittest.TestCase):
def test_cubic_bezier_point_start_stop(self):
import numpy as np
for _ in range(1000):
b = get_random_cubic_bezier()
self.assertEqual(b.start, b.point(0))
self.assertEqual(b.end, b.point(1))
self.assertTrue(np.all(np.array([list(b.start), list(b.end)])
== b.npoint([0, 1])))
def test_cubic_bezier_point_implementations_match(self):
import numpy as np
for _ in range(1000):
b = get_random_cubic_bezier()
pos = np.linspace(0, 1, 100)
v1 = b.npoint(pos)
v2 = []
for i in range(len(pos)):
v2.append(b.point(pos[i]))
for p, p1, p2 in zip(pos, v1, v2):
self.assertEqual(b.point(p), Point(p1))
self.assertEqual(Point(p1), Point(p2))
|
