The problem is the following : I have to transform a triangulation $t1$ intro a triangulation $t2$ of the same set of points.
First i use the Edge Flip Algorithm to get the flips needed to transform triangulation $t1$ into the Delaunay triangulation of the set of points.
I do the same for the second one.
Now the answer would be that the correct way to transform $t1$ into $t2$ is to transform $t1$ into the Delaunay triangulation and after that apply the opposite operations of the $t2$ to Delaunay transformation.
The issue i found is the following : I have four points. Three that form a triangle(A,B,C) and one that is not contained in it (D). The problem is that there might exist cases where even the fourth point might be found in the circumscribed circle of triangle ABC.
To be more precise, the determinant of the four points is equal to 0.
How should i decide if i should make a flip ? The Flip is this case doesn't seem to do anything.
P.S. I know if A,B,C are in CCW or CW position.