private DelaunayTriangle[] discardConsideredNeighbours(DelaunayTriangle[] neighbours)
	{
		int unconsidered = neighbours.length;
		for (int i = 0; i < neighbours.length; i++)
		{
			if(considered.contains(neighbours[i]))
				unconsidered--;
		}
		DelaunayTriangle[] result = new DelaunayTriangle[unconsidered];
		int index = 0;
		for (int i = 0; i < neighbours.length; i++)
		{
			if(!considered.contains(neighbours[i]))
			{
				result[index] = neighbours[i];
				index++;
			}
		}
		return result;
	}