Transfer coordinates from one triangle to another triangle

by

Let you have unknown affine transformation matrix

   | a c e |
M =| b d f |
   | 0 0 1 |

The first triangle vertices are (xa1, ya1), (xa2, ya2), (xa3, ya3), and the second triangle vertices have coordinates (xb1, yb1), (xb2, yb2), (xb3, yb3).

Then affine transformation M that transforms the first triangle vertices to the second one vertices is:

M * A = B

where

   | xa1 xa2 xa3 |
A =| ya1 ya2 ya3 |
   |  1   1   1  |

   | xb1 xb2 xb3 |
B =| yb1 yb2 yb3 |
   |  1   1   1  |

To find unknown M, we can multiply both sides of the expression by inverse of A matrix

M * A * Inv(A) = B * Inv(A)
M = B * Inv(A)

Inversion of A is rather simple (calculated by Maple, may contain errors due to my typos):

| (ya2-ya3)    -(xa2-xa3)    (xa2*ya3-xa3*ya2)  |
| -(-ya3+ya1)  (-xa3+xa1)    -(xa1*ya3-ya1*xa3) | * 1/Det
| (-ya2+ya1)   -(-xa2+xa1)   (xa1*ya2-ya1*xa2)  |

where determinant value is

Det = xa2*ya3-xa3*ya2-ya1*xa2+ya1*xa3+xa1*ya2-xa1*ya3

So you can find affine matrix for needed transformation and apply it to coordinates (multiply M and (x,y,1) column matrix)

More Related Contents:

  1. How do you detect where two line segments intersect? [closed]
  2. Circle-Rectangle collision detection (intersection)
  3. ray and ellipsoid intersection accuracy improvement
  4. How to create circle with Bézier curves?
  5. Problem superimposing and aligning 3D triangles
  6. Efficiently find points inside a circle sector
  7. How do I determine if two convex polygons intersect?
  8. algorithm to rasterize and fill a hypersphere?
  9. Is there a more efficient way of texturing a circle?
  10. How to test if a point is inside of a convex polygon in 2D integer coordinates?
  11. How to determine whether a point (X,Y) is contained within an arc section of a circle (i.e. a Pie slice)?
  12. Boundary enclosing a given set of points
  13. Finding holes in 2d point sets?
  14. Evenly distributing n points on a sphere
  15. Cone to box collision
  16. What is the fastest algorithm to calculate the minimum distance between two sets of points?
  17. Make a sphere with equidistant vertices
  18. Is there an efficient algorithm to generate a 2D concave hull?
  19. Signed angle between two 3D vectors with same origin within the same plane
  20. How to find two most distant points?
  21. How to find largest triangle in convex hull aside from brute force search
  22. Shortest distance between two line segments
  23. Create non-intersecting polygon passing through all given points
  24. Finding the coordinates of points from distance matrix
  25. How to rotate a vertex around a certain point?
  26. Mesh generation from points with x, y and z coordinates
  27. How do you find a point at a given perpendicular distance from a line?
  28. 3D coordinates on a sphere to Latitude and Longitude
  29. Intersection of two lines defined in (rho/theta ) parameterization
  30. Converting an svg arc to lines

Leave a Comment