When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Distance from a point to a line - Wikipedia

    en.wikipedia.org/.../Distance_from_a_point_to_a_line

    The distance (or perpendicular distance) from a point to a line is the shortest distance from a fixed point to any point on a fixed infinite line in Euclidean geometry. It is the length of the line segment which joins the point to the line and is perpendicular to the line. The formula for calculating it can be derived and expressed in several ways.

  3. Skew lines - Wikipedia

    en.wikipedia.org/wiki/Skew_lines

    The nearest points and form the shortest line segment joining Line 1 and Line 2: d = ‖ c 1 − c 2 ‖ . {\displaystyle d=\Vert \mathbf {c_{1}} -\mathbf {c_{2}} \Vert .} The distance between nearest points in two skew lines may also be expressed using other vectors:

  4. Euclidean distance - Wikipedia

    en.wikipedia.org/wiki/Euclidean_distance

    In mathematics, the Euclidean distance between two points in Euclidean space is the length of the line segment between them. It can be calculated from the Cartesian coordinates of the points using the Pythagorean theorem , and therefore is occasionally called the Pythagorean distance .

  5. Taxicab geometry - Wikipedia

    en.wikipedia.org/wiki/Taxicab_geometry

    In taxicab geometry, the distance between any two points equals the length of their shortest grid path. This different definition of distance also leads to a different definition of the length of a curve, for which a line segment between any two points has the same length as a grid path between those points rather than its Euclidean length.

  6. Geodesic - Wikipedia

    en.wikipedia.org/wiki/Geodesic

    Going the "long way round" on a great circle between two points on a sphere is a geodesic but not the shortest path between the points. The map t → t 2 {\displaystyle t\to t^{2}} from the unit interval on the real number line to itself gives the shortest path between 0 and 1, but is not a geodesic because the velocity of the corresponding ...

  7. Closest pair of points problem - Wikipedia

    en.wikipedia.org/wiki/Closest_pair_of_points_problem

    The closest pair of points problem or closest pair problem is a problem of computational geometry: given points in metric space, find a pair of points with the smallest distance between them. The closest pair problem for points in the Euclidean plane [ 1 ] was among the first geometric problems that were treated at the origins of the systematic ...

  8. Distance between two parallel lines - Wikipedia

    en.wikipedia.org/wiki/Distance_between_two...

    Because the lines are parallel, the perpendicular distance between them is a constant, so it does not matter which point is chosen to measure the distance. Given the equations of two non-vertical parallel lines = + = +, the distance between the two lines is the distance between the two intersection points of these lines with the perpendicular ...

  9. Displacement (geometry) - Wikipedia

    en.wikipedia.org/wiki/Displacement_(geometry)

    In geometry and mechanics, a displacement is a vector whose length is the shortest distance from the initial to the final position of a point P undergoing motion. [1] It quantifies both the distance and direction of the net or total motion along a straight line from the initial position to the final position of the point trajectory.