-new unit testing module (test_voronoi_utility.py):
	-working on a test of the spherical surface Delaunay triangulation -- the number of facets (simplices or triangles) of a d-polytope can be estimated based on a big O-algorithm as a function of the number of input points [Seidel (1995) Computational Geometry 5]
	-I'm currently having trouble with the above test though--there must be something I don't understand about how this works.