Finding the Intersection Point of Two Lines in Vector Form

ross
Messages
4
Reaction score
0
I'm using the following equation to represent lines

(x, y) = (start_x, start_y) + t((end_x, end_y) - (start_x, start_y))

I'm trying to find the interesection point of two lines written in this form.

I have been able to solve for t and plug it back into the equation, but i get two values of t when i solve for it. So that gives me 2 possible x values and 2 possible y values in the end. One x value is correct, and one y value is correct, but I get a wrong x value and a wrong y value.

I'm wondering if there's a totally different way, or a way to get rid of the x and y value that I don't need.

Thanks.
 
Physics news on Phys.org
Welcome to PF!
You are going about this in a fundamentally wrong way.
The parameter "t" need not have the same value at the point of intersection for each line!
What you need, is to solve a 2*2 system of two unknowns, the two parametrization variables:
Let superscript "1" denote Line 1 expression, "2" Line 2 expression.
Then we may write:
(x,y)=(x^{1}_{0},y^{1}_{0})+t^{1}(x_{1}^{1}-x_{0}^{1}, y_{1}^{1}-y_{0}^{1})
And line 2:
(x,y)=(x^{2}_{0},y^{2}_{0})+t^{2}(x_{1}^{2}-x_{0}^{2}, y_{1}^{2}-y_{0}^{2})
Set these expressions equal to each other, and solve for t^{1},t^{2}

You may also eliminate the parametrization variable, and solve the following system
for x and y:
y=a^{1}x+b^{1}
y=a^{2}x+b^{2}
 
Ok, thanks.

What I ended up doing was turning the (x, y) = (a, b) + t(c - a, d - b) into y = mx + b. Then I solved for x and y.

The reason I wanted t was to know whether the intersection was actually between the two points (0 <= t <= 1). But I can just plug the point I found back into the first equation and solve for t.

x = a + t(c - a)
t = (x - a) / (c - a)
 
##\textbf{Exercise 10}:## I came across the following solution online: Questions: 1. When the author states in "that ring (not sure if he is referring to ##R## or ##R/\mathfrak{p}##, but I am guessing the later) ##x_n x_{n+1}=0## for all odd $n$ and ##x_{n+1}## is invertible, so that ##x_n=0##" 2. How does ##x_nx_{n+1}=0## implies that ##x_{n+1}## is invertible and ##x_n=0##. I mean if the quotient ring ##R/\mathfrak{p}## is an integral domain, and ##x_{n+1}## is invertible then...
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