Area of Parallelogram w/ Points A,B,C

  • Thread starter Thread starter ttiger2k7
  • Start date Start date
  • Tags Tags
    Vector
ttiger2k7
Messages
57
Reaction score
0

Homework Statement



What is the area of a parallelogram that has points A(1,2,-3), B(2,0,4), & C(5,1,-2) as three of its four vertices?

Homework Equations


none, really


The Attempt at a Solution



First, I found two vectors, \vec{AB} and \vec{BC}.

\vec{AB} is <1,-2,7> and \vec{BC} is <-3,-1,6>

Then the cross product between the two: -9i + 3j + 7k.

And then the magnitude: \sqrt{81+9+49} = \sqrt{139}

Is this the correct way of solving this problem? Thank you.
 
Physics news on Phys.org
ttiger2k7 said:

Homework Statement



What is the area of a parallelogram that has points A(1,2,-3), B(2,0,4), & C(5,1,-2) as three of its four vertices?

Homework Equations


none, really

Homework Equations


Area of the thing = area of triangle * 2

What's area of triangle?
Write in terms of sin theta
 
Please, please, please don't just memorize formulas without learning what they mean! You have, in fact, done the calculation correctly but that is meaningless if you don't know it is correct and, better, understand why it is correct!

One definition of cross product is "The cross product of two vectors, u and v is the vector at right angles to both (in the "right hand" sense) with length |u||v|sin\theta where [/itex]\theta[/itex] is the angle between the two vectors".

Now, remember that the area of a parallelogram is "base time height" where the height is measured from one vertex perpendicular to the base. That gives a right triangle where the length of one side is the hypotenuse and the height is the side opposite angle \theta. If v forms the base and u is the other side, then the height is |u|sin(\theta) so the area of the parallelogram is |u||v|sin\theta. Look familiar?
 
Thread 'Use greedy vertex coloring algorithm to prove the upper bound of χ'
Hi! I am struggling with the exercise I mentioned under "Homework statement". The exercise is about a specific "greedy vertex coloring algorithm". One definition (which matches what my book uses) can be found here: https://people.cs.uchicago.edu/~laci/HANDOUTS/greedycoloring.pdf Here is also a screenshot of the relevant parts of the linked PDF, i.e. the def. of the algorithm: Sadly I don't have much to show as far as a solution attempt goes, as I am stuck on how to proceed. I thought...
Back
Top