def test_bigger(self):
"""test_bigger
test larger mesh
"""
points, vertices, boundary = rectangular(4, 4, 1, 1)
mesh = Mesh(points, vertices, boundary)
#Test that points are arranged in a counter clock wise order
mesh.check_integrity()
root = MeshQuadtree(mesh)
root.set_last_triangle()
for x in [[0.6, 0.3], [0.1, 0.2], [0.7,0.7],
[0.1,0.9], [0.4,0.6], [0.9,0.1],
[10, 3]]:
found, s0, s1, s2, k = root.search_fast(ensure_numeric(x))
if k >= 0:
V = mesh.get_vertex_coordinates(k) # nodes for triangle k
assert is_inside_polygon(x, V)
assert found is True
#print k, x
else:
assert found is False
def test_large(self):
"""test_larger mesh and different quad trees
"""
points, vertices, boundary = rectangular(10, 12, 1, 1)
mesh = Mesh(points, vertices, boundary)
#Test that points are arranged in a counter clock wise order
mesh.check_integrity()
root = MeshQuadtree(mesh)
root.set_last_triangle()
#print m, root.show()
for x in [[0.6, 0.3], [0.1, 0.2], [0.7,0.7],
[0.1,0.9], [0.4,0.6], [0.9,0.1],
[10, 3]]:
found, s0, s1, s2, k = root.search_fast(x)
if k >= 0:
V = mesh.get_vertex_coordinates(k) # nodes for triangle k
assert is_inside_triangle(x, V, closed=True)
assert is_inside_polygon(x, V)
assert found is True
else:
assert found is False
if k == 0: return
def test_bigger(self):
"""test_bigger
test larger mesh
"""
points, vertices, boundary = rectangular(4, 4, 1, 1)
mesh = Mesh(points, vertices, boundary)
#Test that points are arranged in a counter clock wise order
mesh.check_integrity()
root = MeshQuadtree(mesh)
root.set_last_triangle()
for x in [[0.6, 0.3], [0.1, 0.2], [0.7,0.7],
[0.1,0.9], [0.4,0.6], [0.9,0.1],
[10, 3]]:
found, s0, s1, s2, k = root.search_fast(ensure_numeric(x))
if k >= 0:
V = mesh.get_vertex_coordinates(k) # nodes for triangle k
assert is_inside_polygon(x, V)
assert found is True
#print k, x
else:
assert found is False
def test_large(self):
"""test_larger mesh and different quad trees
"""
points, vertices, boundary = rectangular(10, 12, 1, 1)
mesh = Mesh(points, vertices, boundary)
#Test that points are arranged in a counter clock wise order
mesh.check_integrity()
root = MeshQuadtree(mesh)
root.set_last_triangle()
#print m, root.show()
for x in [[0.6, 0.3], [0.1, 0.2], [0.7,0.7],
[0.1,0.9], [0.4,0.6], [0.9,0.1],
[10, 3]]:
found, s0, s1, s2, k = root.search_fast(x)
if k >= 0:
V = mesh.get_vertex_coordinates(k) # nodes for triangle k
assert is_inside_triangle(x, V, closed=True)
assert is_inside_polygon(x, V)
assert found is True
else:
assert found is False
if k == 0: return
def test_underlying_function(self):
"""test_larger mesh and different quad trees
"""
return
points, vertices, boundary = rectangular(2, 2, 1, 1)
mesh = Mesh(points, vertices, boundary)
root = MeshQuadtree(mesh)
root.set_last_triangle()
# One point
x = ensure_numeric([0.5, 0.5])
found, sigma0, sigma1, sigma2, k = \
root._search_triangles_of_vertices(root.search(x), x)
if k >= 0:
V = mesh.get_vertex_coordinates(k) # nodes for triangle k
assert is_inside_polygon(x, V)
assert found is True
else:
assert found is False
# More points
for x in [[0.6, 0.3], [0.1, 0.2], [0.7,0.7],
[0.1,0.9], [0.4,0.6], [0.9,0.1],
[10, 3]]:
triangles = root.search(x)
#print x, candidate_vertices
found, sigma0, sigma1, sigma2, k = \
root._search_triangles_of_vertices(triangles,
ensure_numeric(x))
if k >= 0:
V = mesh.get_vertex_coordinates(k) # nodes for triangle k
assert is_inside_polygon(x, V)
assert found is True
else:
assert found is False
def test_underlying_function(self):
"""test_larger mesh and different quad trees
"""
return
points, vertices, boundary = rectangular(2, 2, 1, 1)
mesh = Mesh(points, vertices, boundary)
root = MeshQuadtree(mesh)
root.set_last_triangle()
# One point
x = ensure_numeric([0.5, 0.5])
found, sigma0, sigma1, sigma2, k = \
root._search_triangles_of_vertices(root.search(x), x)
if k >= 0:
V = mesh.get_vertex_coordinates(k) # nodes for triangle k
assert is_inside_polygon(x, V)
assert found is True
else:
assert found is False
# More points
for x in [[0.6, 0.3], [0.1, 0.2], [0.7,0.7],
[0.1,0.9], [0.4,0.6], [0.9,0.1],
[10, 3]]:
triangles = root.search(x)
#print x, candidate_vertices
found, sigma0, sigma1, sigma2, k = \
root._search_triangles_of_vertices(triangles,
ensure_numeric(x))
if k >= 0:
V = mesh.get_vertex_coordinates(k) # nodes for triangle k
assert is_inside_polygon(x, V)
assert found is True
else:
assert found is False
