spatial.tests.test_qhull

Module Contents

Classes

Test_Qhull()
TestUtilities() Check that utility functions work.
TestVertexNeighborVertices()
TestDelaunay() Check that triangulation works.
TestConvexHull()
TestVoronoi()
Test_HalfspaceIntersection()

Functions

sorted_tuple(x)
sorted_unique_tuple(x)
assert_unordered_tuple_list_equal(a,b,tpl=tuple)
_add_inc_data(name,chunksize) Generate incremental datasets from basic data sets
assert_hulls_equal(points,facets_1,facets_2)
sorted_tuple(x)
sorted_unique_tuple(x)
assert_unordered_tuple_list_equal(a, b, tpl=tuple)
_add_inc_data(name, chunksize)

Generate incremental datasets from basic data sets

class Test_Qhull
test_swapping()
class TestUtilities

Check that utility functions work.

test_find_simplex()
test_plane_distance()
test_convex_hull()
test_volume_area()
test_random_volume_area()
test_incremental_volume_area_random_input()

Test that incremental mode gives the same volume/area as non-incremental mode and incremental mode with restart

_check_barycentric_transforms(tri, err_msg="", unit_cube=False, unit_cube_tol=0)

Check that a triangulation has reasonable barycentric transforms

test_degenerate_barycentric_transforms()
test_more_barycentric_transforms()
class TestVertexNeighborVertices
_check(tri)
test_triangle()
test_rectangle()
test_complicated()
class TestDelaunay

Check that triangulation works.

test_masked_array_fails()
test_array_with_nans_fails()
test_nd_simplex()
test_2d_square()
test_duplicate_points()
test_pathological()
test_joggle()
test_coplanar()
test_furthest_site()
test_incremental(name)
assert_hulls_equal(points, facets_1, facets_2)
class TestConvexHull
test_masked_array_fails()
test_array_with_nans_fails()
test_hull_consistency_tri(name)
test_incremental(name)
test_vertices_2d()
test_volume_area()
class TestVoronoi
test_masked_array_fails()
test_simple()
_compare_qvoronoi(points, output, **kw)

Compare to output from ‘qvoronoi o Fv < data’ to Voronoi()

test_ridges(name)
test_furthest_site()
test_incremental(name)
class Test_HalfspaceIntersection
assert_unordered_allclose(arr1, arr2, rtol=1e-07)

Check that every line in arr1 is only once in arr2

test_cube_halfspace_intersection()
test_self_dual_polytope_intersection()
test_wrong_feasible_point()
test_incremental()