Minimum distance between two vectors on a graph?

• dan.g117
In summary, the conversation discusses how to calculate the minimum distance between two vectors with constant velocity, both algebraically and graphically, and the limitations of using a position graph alone to determine this distance.
dan.g117

Homework Statement

This is just a theoretical question so there aren't any values for the variables but there are two vectors with constant velocity. Given their velocity, magnitude, direction how can one calculate the minimum distance between the two vectors.

Also have to solve graphically

The Attempt at a Solution

I'm currently under the assumption it has to do with slope or something along those lines.
Input greatly appreciated.

http://img22.imageshack.us/my.php?image=examplehr3.jpg

thanks!

Welcome to PF.

Algebraically you can take the position difference vector as a function of time and determine the minimum.

Graphically ... just extending the line of action of position vectors doesn't seem to solve the problem you are asking about minimizing the position difference vector. A position graph alone doesn't really account for the rate of change of position as a function of time.

I can provide some insights into the problem and possible approaches to solving it. The minimum distance between two vectors on a graph can be calculated using the concept of vector projection. This involves finding the component of one vector that lies in the direction of the other vector, and then calculating the distance between the two vectors using this component.

To solve graphically, you can plot the two vectors on a graph and draw a line connecting the two vectors. This line represents the shortest distance between the two vectors. You can then use the Pythagorean theorem to calculate the length of this line, which is the minimum distance between the two vectors.

Another approach is to use vector algebra to calculate the dot product between the two vectors. The dot product represents the magnitude of one vector in the direction of the other vector. By dividing this value by the magnitude of the second vector, you can calculate the length of the component of the first vector in the direction of the second vector. This component can then be used to calculate the minimum distance between the two vectors.

Overall, the minimum distance between two vectors on a graph can be calculated using a combination of vector projection, Pythagorean theorem, and vector algebra. It is important to note that the values of velocity, magnitude, and direction are crucial in accurately calculating the minimum distance. Therefore, it is important to have these values in order to solve the problem effectively.

1. What is the minimum distance between two vectors on a graph?

The minimum distance between two vectors on a graph is the shortest distance between the two points represented by the vectors. It can be calculated using the Pythagorean theorem, where the length of the hypotenuse of a right triangle is the shortest distance between the two points.

2. How do you calculate the minimum distance between two vectors on a graph?

To calculate the minimum distance between two vectors on a graph, you can use the Pythagorean theorem or the distance formula. The distance formula takes into account both the horizontal and vertical distances between the two points, while the Pythagorean theorem only considers the length of the hypotenuse.

3. Can the minimum distance between two vectors on a graph be negative?

No, the minimum distance between two vectors on a graph cannot be negative. Distance is a measure of how far apart two points are, and it is always a positive value. In some cases, the minimum distance may be zero if the two vectors are overlapping or intersecting at a point.

4. How does the minimum distance between two vectors on a graph relate to the angle between them?

The minimum distance between two vectors on a graph is directly related to the angle between them. As the angle between the two vectors increases, the minimum distance between them also increases. This can be observed by using the distance formula, where the angle between the two vectors is one of the variables used to calculate the distance.

5. How can the minimum distance between two vectors on a graph be used in real-life situations?

The concept of minimum distance between two vectors on a graph has various real-life applications. For example, it can be used in navigation systems to calculate the shortest distance between two points, or in physics to determine the minimum distance between two objects in motion. It can also be used in computer graphics to create realistic 3D models by calculating the minimum distance between points on the surface of an object.

• Introductory Physics Homework Help
Replies
10
Views
1K
• Introductory Physics Homework Help
Replies
13
Views
3K
• Introductory Physics Homework Help
Replies
8
Views
2K
• Introductory Physics Homework Help
Replies
2
Views
2K
• Introductory Physics Homework Help
Replies
58
Views
3K
• Introductory Physics Homework Help
Replies
4
Views
4K
• Introductory Physics Homework Help
Replies
10
Views
1K
• Introductory Physics Homework Help
Replies
7
Views
5K
• Introductory Physics Homework Help
Replies
1
Views
3K
• Introductory Physics Homework Help
Replies
7
Views
1K