The shortest path is a line perpendicular to the given line that passes through the given point.
line segment
The shortest path between two points
Yes, on a plane surface (a flat sheet of paper, for example).
A line.
Line
The shortest path between two points is called a geodesic. In flat (Euclidean) space it is simply a straight line.
a segment of a strate line
line segment
The shortest path between two points
2D line.
difference between shortest path and alternate path
The displacement is 6km because it is the straight-line distance from the starting point to the final point. The displacement represents the shortest path between the two points, regardless of the actual distance traveled.
actually, there is, depending on your definition of polygon, and your definition of a line segment. A line segment is the shortest path btwn two points, right? So take a sphere and pick any two points on that sphere. The shortest path between them on the surface of the sphere would be a "curve" along the surface, but it's the shortest path between the points, so it technally is a line segment. Take two of these line segments that intersect at two points, and there is your two sided polygon!
Yes, on a plane surface (a flat sheet of paper, for example).
The shortest path from a starting point to an endpoint regardless of the path taken is called the "optimal path" or "minimum path." This path minimizes the distance, time, or cost required to reach the endpoint.
In plain geometry, the shortest distance between two points is a straight line, or, more precisely, the line segment connecting point A to point B.There are other possibilities when we move off a two-dimensional plane. On a sphere, like the surface of the earth, a "great circle" path is the shortest distance. (A great circle is a circle that runs along the surface of that sphere so as to cut it into two equal halves) Any route from A to B is going to be the arc drawn from A to B with the center of the earth as the point of reference (the place to put the point of the compass). This is an example of non-Euclidean geometry and there are many others.It can get even more complicated. For example, there is elliptic and a hyperbolic geometry each with its own different replacement for the straight line in plain geometry.A line
The shortest path in an undirected graph is the path between two vertices that has the smallest total sum of edge weights.