private DelaunayTriangle getNextTriangle(DelaunayTriangle current, DelaunayTriangle previous)
	{
		DelaunayTriangle next;
		DelaunayTriangle[] neighbours = getInternalNeighbours(current);
		if(neighbours.length==1)
		{
			next = neighbours[0];
		}
		else if(neighbours.length==2)
		{
			if(neighbours[0]==previous)
				next = neighbours[1];
			else
				next = neighbours[0];
		}
		else
		{
			//No problem, current triangle will not be pruned since it is a junction triangle
			System.err.println("Junction triangle should not be pruned");
			next = neighbours[0];
		}
		return next;
	}