Find the shortest distance between two points

People always choose a shorter route to reach their destination. To this end, Lona from the angle of mathematical geometry to explore such phenomena. Next, review them from different dimensions and between them.

At one point, there is a A/b two position, an object is in the position of a, it wants to go to B position, need to pass how much distance, to achieve it! If, in terms of people's experience,

This object only needs to be in situ to reach the position of B. From the point of view of mathematical geometry, the author believes that it is possible to reach a number of finite void distances. If the reader cannot understand this

A little, it doesn't matter, and the new content will continue to be explained later. OK, let's go on exploring.

On one line, there is a A/b two locations (in this A/b is not coincident, because of the coincident situation, discussed by the above points), an object is in the position of a, it wants to go to B position, how many paths can be selected! This is different from the point above. We divide the situation into two kinds, one is that there is no intersecting line, and the other is the intersecting line.

First, there is no intersecting line, (this is just one of the cases, as long as there is no intersecting line, just the following):

No matter what the line looks like, the path between A/b is just one, or it's the shortest path on the line between A/b, because there's no other path to choose from. In mathematical geometry, the shortest path between the two lines is a straight line segment, where the actual situation needs to be considered, followed by detailed answers.

Now discuss the intersecting lines,

In this intersection of the line (a continuous line, not a segmented line), an object in a position to reach the B position, there are many paths to choose, if it wants to find the shortest path, how to do it! More feasible way, try to pass through each intersection point, as long as it tries enough times, can compare the shortest path is what! But the intersection point is very long, it should be good. Luck is a bit of a problem. I suddenly think of this is a better way, is to let the B-position signal direction, so that the object at the intersection can choose a relatively consistent cross in the direction of the intersection of the appropriate entrance, but suddenly there is a problem out, into the process, found the direction of obvious changes, whether to return, re-select it! Now the question is, can you make sure that the object in position A is the shortest position to reach the B position before it departs? Again, we are currently in a line to explore. Answer, did you think of it? No or Yes, if yes, the method is what, the author does not test everyone, published the answer, in a line, can not know how to find such a method.

Find the shortest distance between two points