How to find coordinates of a 2d equilateral triangle in C?

I have the coordinates (x,y) of 2 points. I want to build the third point so that these 3 po开发者_运维知识库ints make an equilateral triangle.

How can I calculate the third point?

Thank you

After reading the posts (specially vkit's) I produced this simple piece of code which will do the trick for one direction (remember that there are two points). The modification for the other case shold be trivial.

#include<stdio.h>
#include<math.h>

typedef struct{
  double x;
  double y;
} Point;

Point vertex(Point p1, Point p2){
  double s60 = sin(60 * M_PI / 180.0);    
  double c60 = cos(60 * M_PI / 180.0);

  Point v = {
    c60 * (p1.x - p2.x) - s60 * (p1.y - p2.y) + p2.x,
    s60 * (p1.x - p2.x) + c60 * (p1.y - p2.y) + p2.y
  };

  return v;
}

You could rotate the second point 60° around first to find the location of the third point.

Something like this:

//find offset from point 1 to 2
dX = x2 - x1;
dY = y2 - y1;
//rotate and add to point 1 to find point 3
x3 = (cos(60°) * dX - sin(60°) * dY) + x1;
y3 = (sin(60°) * dX + cos(60°) * dY) + y1;

Let's call your two points A and B. Bisect AB, call this point C. Find the slope of AB (Y_A-Y_B / X_A-X_B), call it m. Find the perpendicular to that (-1/m) and call it m₂. Then compute a segment CD whose length is sin(60) * length(AB), at the slope m₂ (there will be two such points, one to each side of AB). ABD is then your equilateral triangle.

That, obviously, is a "constructive" method. You should also be able to do it by solving a set of linear equations. I haven't tried to figure out the right system of equations for this case, but this approach tends to be somewhat more stable numerically, and has fewer special cases (e.g., with the constructive version, a slope of 0 has to be dealt with specially).

For BlueRaja's challenge go to end of post:

Answer using translation and rotation:

Says points are P(x1,y1) and Q(x2,y2).

Since it is graphics, you can use tranforms to get the point.

First translate axes so P is the origin. Next rotate Q around P by 60 degrees (or -60 to get the other possible point).

This gives you the coordinates of the third point say R, when P is the origin.

Translate back and there you have it.

You can use standard graphics API which take care of precision etc issues for you. No headaches.

Of course you could do the math and actually come up with a formula and use that and that might be faster, but then the question might get closed as off-topic ;-)

To take up BlueRaja's challenge: Here is a method which does not use trigonometry.

Given points P(x1,y1) and Q(x2,y2) Say the point we need (R) to find is (x3,y3).

Let T be midpoint of PQ.

We know the area of triangle PQR (as it is equilateral and we know the side)

and we know the area of triangle PRT (1/2 the earlier area).

Now area of a triangle can be written as a determinant having the co-ordinates as entries:

2*Area = |D|

where

     | 1 x1 y1|
D =  | 1 x2 y2|
     | 1 x3 y3|

We have two such equations (which are linear), solve for x3 and y3.

pc <- c((x1+x2)/2,(y1+y2)/2) #center point
ov <- c(y2-y1,x1-x2) #orthogonal vector
p3 <- pc+sqrt(3/4)*ov #The 3dr point in equilateral triangle (center point + height of triangle*orthogonal vector)