private TriangulationPoint[] getMidPoints(DelaunayTriangle triangle)
	{
		TriangulationPoint[] result = null;
		if(isTerminal(triangle))
		{
			result = new TriangulationPoint[1];
			for (int i = 0; i < 3; i++)
			{
				TriangulationPoint p1 = triangle.points[i];
				TriangulationPoint p2 = triangle.points[(i + 1) % 3];
				if (isInnerEdge(p1, p2))
				{
					TriangulationPoint midpoint = Util.getMidpoint(p1,p2);
						result[0] = midpoint;
				}
			}
		}
		else if(isSleeve(triangle))
		{
			result = new TriangulationPoint[2];
			int index = 0;
			for (int i = 0; i < 3; i++)
			{
				TriangulationPoint p1 = triangle.points[i];
				TriangulationPoint p2 = triangle.points[(i + 1) % 3];
				if (isInnerEdge(p1, p2))
				{
					TriangulationPoint midpoint = Util.getMidpoint(p1,p2);
						result[index] = midpoint;
						index++;
				}
			}
		}
		else if(isJunction(triangle))
		{
			result = new TriangulationPoint[4];
			int index = 0;
			for (int i = 0; i < 3; i++)
			{
				TriangulationPoint p1 = triangle.points[i];
				TriangulationPoint p2 = triangle.points[(i + 1) % 3];
				if (isInnerEdge(p1, p2))
				{
					TriangulationPoint midpoint = Util.getMidpoint(p1,p2);
						result[index] = midpoint;
						index++;
				}
			}
		}
		return result;
	}