Skip to content

Commit

Permalink
Add geometry and mulgrid unit tests
Browse files Browse the repository at this point in the history
  • Loading branch information
@acroucher
acroucher committed Feb 20, 2020
1 parent 3af88f0 commit 32fb3e2
Show file tree
Hide file tree
Showing 12 changed files with 88,220 additions and 0 deletions.
Binary file added tests/mulgrid/fit_surface_data.npy
View file
Binary file not shown.
Binary file added tests/mulgrid/fit_surface_result.npy
View file
Binary file not shown.
3,810 changes: 3,810 additions & 0 deletions tests/mulgrid/g1.dat
View file

Large diffs are not rendered by default.

9,757 changes: 9,757 additions & 0 deletions tests/mulgrid/g2.dat
View file

Large diffs are not rendered by default.

5,001 changes: 5,001 additions & 0 deletions tests/mulgrid/g3.dat
View file

Large diffs are not rendered by default.

13,801 changes: 13,801 additions & 0 deletions tests/mulgrid/g4.dat
View file

Large diffs are not rendered by default.

2,919 changes: 2,919 additions & 0 deletions tests/mulgrid/g5.dat
View file

Large diffs are not rendered by default.

9,195 changes: 9,195 additions & 0 deletions tests/mulgrid/in
View file

Large diffs are not rendered by default.

Binary file added tests/mulgrid/refine_areas.npy
View file
Binary file not shown.
43,148 changes: 43,148 additions & 0 deletions tests/mulgrid/segmt
View file

Large diffs are not rendered by default.

265 changes: 265 additions & 0 deletions tests/test_geometry.py
View file
Original file line number Diff line number Diff line change
@@ -0,0 +1,265 @@
import unittest
from geometry import *

class geometryTestCase(unittest.TestCase):

def test_in_polygon(self):
"""in_polygon()"""
poly = [
np.array([0., 0.]),
np.array([1., 0.]),
np.array([0., 1.]),
]
p = np.array([0.8, 0.9])
self.assertFalse(in_polygon(p, poly))
p = np.array([0.4, 0.3])
self.assertTrue(in_polygon(p, poly))

def test_in_rectangle(self):
"""in_rectangle()"""
rect = [
np.array([5., 4.]),
np.array([8., 11.]),
]
p = np.array([0.8, 0.9])
self.assertFalse(in_rectangle(p, rect))
p = np.array([7., 10.5])
self.assertTrue(in_rectangle(p, rect))

def test_rect_intersect(self):
"""rectangles_intersect()"""
r1 = [
np.array([5., 4.]),
np.array([8., 11.]),
]
r2 = [
np.array([7., 5.]),
np.array([13., 10.]),
]
self.assertTrue(rectangles_intersect(r1, r2))
self.assertTrue(rectangles_intersect(r2, r1))
r2 = [
np.array([1., 2.]),
np.array([4.6, 10.]),
]
self.assertFalse(rectangles_intersect(r1, r2))
self.assertFalse(rectangles_intersect(r2, r1))

def test_bounds_of_points(self):
"""bounds_of_points()"""
pts = [
np.array([-1.5, 2.1]),
np.array([1., -1.1]),
np.array([4., 3.])
]
bds = bounds_of_points(pts)
self.assertTrue((np.array([-1.5, -1.1]) == bds[0]).all())
self.assertTrue((np.array([4., 3.]) == bds[1]).all())

def test_polygon_area(self):
"""poygon_area()"""
poly = [
np.array([0., 0.]),
np.array([1., 0.]),
np.array([0., 1.]),
]
self.assertAlmostEqual(0.5, polygon_area(poly))
poly = [
np.array([1., 2.]),
np.array([3., 2.]),
np.array([3., 4.]),
np.array([1., 4.]),
]
self.assertAlmostEqual(4., polygon_area(poly))
t = linear_trans2().rotation(30.)
poly = [t(p) for p in poly]
self.assertAlmostEqual(4., polygon_area(poly))

def test_polygon_centroid(self):
"""polygon_centroid()"""
tol = 1.e-6
poly = [
np.array([1., 2.]),
np.array([3., 2.]),
np.array([3., 4.]),
np.array([1., 4.]),
]
c = polygon_centroid(poly)
self.assertTrue((np.abs(np.array([2., 3.]) - c) <= tol).all())
poly = [
np.array([0., 0.]),
np.array([15., 0.]),
np.array([15., 5.]),
np.array([10., 5.]),
np.array([10., 10.]),
np.array([0., 10.])
]
c = polygon_centroid(poly)
self.assertTrue((np.abs(np.array([6.5, 4.5]) - c) <= tol).all())

def test_line_polygon_intersect(self):
"""line_polygon_intersections()"""
tol = 1.e-6
poly = [
np.array([0., 0.]),
np.array([15., 0.]),
np.array([15., 5.]),
np.array([10., 5.]),
np.array([10., 10.]),
np.array([0., 10.])
]
line = [
np.array([0., 0.]),
np.array([15., 4.])
]
pts = line_polygon_intersections(poly, line)
self.assertEqual(2, len(pts))
self.assertTrue((np.abs(np.array([0., 0.]) - pts[0]) <= tol).all())
self.assertTrue((np.abs(np.array([15., 4.]) - pts[1]) <= tol).all())
line = [
np.array([0., 17.5]),
np.array([17.5, 0.])
]
pts = line_polygon_intersections(poly, line)
self.assertEqual(4, len(pts))
self.assertTrue((np.abs(np.array([7.5, 10.]) - pts[0]) <= tol).all())
self.assertTrue((np.abs(np.array([10., 7.5]) - pts[1]) <= tol).all())
self.assertTrue((np.abs(np.array([12.5, 5.]) - pts[2]) <= tol).all())
self.assertTrue((np.abs(np.array([15., 2.5]) - pts[3]) <= tol).all())

def test_simplify_polygon(self):
"""simplify_polygon()"""
poly = [
np.array([0., 0.]),
np.array([1., 0.]),
np.array([1., 1.]),
np.array([0.5, 1.]),
np.array([0., 1.])
]
s = simplify_polygon(poly)
self.assertEqual(4, len(s))
poly = [
np.array([0., 0.]),
np.array([10., 0.]),
np.array([15., 0.]),
np.array([15., 5.]),
np.array([11., 5.]),
np.array([10., 5.]),
np.array([10., 10.]),
np.array([2., 10.]),
np.array([0., 10.])
]
s = simplify_polygon(poly)
self.assertEqual(6, len(s))

def test_polygon_boundary(self):
"""polygon_boundary()"""
tol = 1.e-6
poly = [
np.array([0., 0.]),
np.array([15., 0.]),
np.array([15., 5.]),
np.array([10., 5.]),
np.array([10., 10.]),
np.array([0., 10.])
]
p1 = np.array([5., -1.])
p2 = np.array([5., 12.])
b = polygon_boundary(p1, p2, poly)
self.assertTrue((np.abs(np.array([5., 0.]) - b) <= tol).all())
p1 = np.array([5., 2.5])
p2 = np.array([20., 2.5])
b = polygon_boundary(p1, p2, poly)
self.assertTrue((np.abs(np.array([15., 2.5]) - b) <= tol).all())
b = polygon_boundary(p2, p1, poly)
self.assertTrue((np.abs(np.array([15., 2.5]) - b) <= tol).all())

def test_line_projection_distance(self):
"""line_projection() and point_line_distance()"""
from math import sqrt
tol = 1.e-6
line = [
np.array([0., 0.]),
np.array([1., 1.])
]
a = np.array([1., 0.])
p, xi = line_projection(a, line, True)
self.assertTrue((np.abs(np.array([0.5, 0.5]) - p) <= tol).all())
self.assertAlmostEqual(0.5, xi)
d = point_line_distance(a, line)
self.assertAlmostEqual(sqrt(0.5), d)
a = np.array([2., 1.])
p, xi = line_projection(a, line, True)
self.assertTrue((np.abs(np.array([1.5, 1.5]) - p) <= tol).all())
self.assertAlmostEqual(1.5, xi)
d = point_line_distance(a, line)
self.assertAlmostEqual(sqrt(0.5), d)

def test_vector_heading(self):
"""vector_heading()"""
from math import atan
p = np.array([0., 10.])
h = vector_heading(p)
self.assertAlmostEqual(0., h)

p = np.array([1., 1.])
h = vector_heading(p)
self.assertAlmostEqual(0.25 * np.pi, h)

p = np.array([-2., -2.])
h = vector_heading(p)
self.assertAlmostEqual(5. * np.pi / 4., h)

p = np.array([-3., 4.])
h = vector_heading(p)
self.assertAlmostEqual(1.5 * np.pi + atan(4./ 3.), h)

def test_linear_trans(self):
"""Linear transformations"""
from math import sqrt
tol = 1.e-6
r1 = [
np.array([5., 4.]),
np.array([8., 11.]),
]
r2 = [
np.array([7., 5.]),
np.array([13., 10.]),
]
r1c = sum(r1) / len(r1)
r2c = sum(r2) / len(r2)

t = linear_trans2().between_rects(r1, r1)
self.assertTrue((np.abs(r1c - t(r1c)) <= tol).all())

t = linear_trans2().between_rects(r1, r2)
self.assertTrue((np.abs(r2c - t(r1c)) <= tol).all())

ti = t.inverse
self.assertTrue((np.abs(r1c - ti(r2c)) <= tol).all())

pts1 = [
np.array([5., 4.]),
np.array([8., 4.]),
np.array([5., 11.])
]
pts2 = [
np.array([7., 5.]),
np.array([13., 5.]),
np.array([7., 10.])
]
t = linear_trans2().between_points(pts1, pts2)
self.assertTrue((np.abs(r2c - t(r1c)) <= tol).all())

t = linear_trans2().rotation(45., np.ones(2))
p = np.array([1., 0.])
sq2 = sqrt(2.)
a = (sq2 - 1.) / sq2
p1 = np.array([a, a])
self.assertTrue((np.abs(p1 - t(p)) <= tol).all())


if __name__ == '__main__':

suite = unittest.TestLoader().loadTestsFromTestCase(geometryTestCase)
unittest.TextTestRunner(verbosity = 1).run(suite)
Loading

0 comments on commit 32fb3e2

Please sign in to comment.