Homogeneous Eqn of Line given 2 homogeneous pointspoints

  • Thread starter Thread starter LouArnold
  • Start date Start date
  • Tags Tags
    Homogeneous Line
LouArnold
Messages
10
Reaction score
0
I'm reviewing Projective Geometry. This is an exercise in 2D homogeneous points and lines. It is not a homework assignment - I'm way too old for that.

Given two points p1 (X1,Y1,W1) and p2 (X2,Y2,W2) find the equation of the line that passes through them (aX+bY+cW=0). (See http://vision.stanford.edu/~birch/projective/node4.html , "Similarly, given two points p1 and p2, the equation..." and http://vision.stanford.edu/~birch/projective/node16.html , Representing the Plucker Equations)

The solution by means of linear algebra is u=p1 x p2 (cross product) = (Y1W2-Y2W1, W1X2-X1W2, X1Y2-Y1X2). I have worked out how to obtain that by calculating a determinant.

However, I should be able to get the same result by using elementary algebra and the basic line equation aX + bY + cW = 0, but somewhere I take a wrong turn. Can someone provide the steps?
 
Last edited by a moderator:
Physics news on Phys.org
You should get the same answer within a global multiplying factor--i.e. a homogeneous multiplier (which is why it's called homogeneous coordinates).

I don't see what the problem is. You've found the homogeneous representation for the line, which is u. The corresponding equation for the line is, for any third point P = (X, Y, W), that u \cdot P = 0, is it not?
 
Muphrid said:
I don't see what the problem is. You've found the homogeneous representation for the line, which is u.
As I stated, I want to find the same result using elementary algebra and not matrix operations such as determinants. It may be a full page of lines so you may want to do it by hand and attach an image of the page. As good as I am in algebra, I'm doing something fundamentally wrong. I start with two equations:
L1: aX1 +bY1 +cW1 = 0 and
L2: aX2 +bY2 +cW2 = 0
(And maybe that's the wrong starting point.)

Because the points are on a line I can set them equal to each other, collect terms and then solve for a, then b, and finally c. But I don't get the answer of the determinant method.

a(X1-X2) + b(Y1-Y2) + c(W1-W2) =0
a=[-b(Y1-Y2) - c(W1-W2)]/(X1-X2)

Now take this value for a and plug it into L1, then solve for b, etc.
 
Because of homogeneity, you should have a degree of freedom to choose one of either a,b,c and set one to a convenient number. The usual choice would be c=1. This should give you the third equation needed to make the system solvable. Otherwise, you have 2 equations and 3 unknowns, and that's kinda silly.
 
Muphrid said:
Because of homogeneity, you should have a degree of freedom to choose one of either a,b,c and set one to a convenient number. The usual choice would be c=1. This should give you the third equation needed to make the system solvable. Otherwise, you have 2 equations and 3 unknowns, and that's kinda silly.
My question stands. If its silly, don't reply.
 
I pointed out you need a third equation to pin down the values of all three variables a,b,c. If that doesn't fix your problem, then please elaborate what your "wrong turn" is. I do not think solving this problem for you will be productive. You haven't even really described what hangup you're having in working out the algebra and solving the system by hand.
 
I asked online questions about Proposition 2.1.1: The answer I got is the following: I have some questions about the answer I got. When the person answering says: ##1.## Is the map ##\mathfrak{q}\mapsto \mathfrak{q} A _\mathfrak{p}## from ##A\setminus \mathfrak{p}\to A_\mathfrak{p}##? But I don't understand what the author meant for the rest of the sentence in mathematical notation: ##2.## In the next statement where the author says: How is ##A\to...
The following are taken from the two sources, 1) from this online page and the book An Introduction to Module Theory by: Ibrahim Assem, Flavio U. Coelho. In the Abelian Categories chapter in the module theory text on page 157, right after presenting IV.2.21 Definition, the authors states "Image and coimage may or may not exist, but if they do, then they are unique up to isomorphism (because so are kernels and cokernels). Also in the reference url page above, the authors present two...
When decomposing a representation ##\rho## of a finite group ##G## into irreducible representations, we can find the number of times the representation contains a particular irrep ##\rho_0## through the character inner product $$ \langle \chi, \chi_0\rangle = \frac{1}{|G|} \sum_{g\in G} \chi(g) \chi_0(g)^*$$ where ##\chi## and ##\chi_0## are the characters of ##\rho## and ##\rho_0##, respectively. Since all group elements in the same conjugacy class have the same characters, this may be...
Back
Top