private DTSweepConstraint findIntersectingEdge(DelaunayTriangle triangle)
	{
		TriangulationPoint[] midpoints = getMidPoints(triangle);
		
		boolean a = prunedChordalAxis.contains(midpoints[0]);
		boolean b = prunedChordalAxis.contains(midpoints[1]);
//		boolean c = prunedChordalAxis.contains(midpoints[2]);
		if(a && b)
		{
			return new DTSweepConstraint(midpoints[0], midpoints[1]);
		}
		else
		{
			return null;
		}
	}