When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Euclidean distance - Wikipedia

    en.wikipedia.org/wiki/Euclidean_distance

    That is (unlike road distance with one-way streets) the distance between two points does not depend on which of the two points is the start and which is the destination. [12] It is positive, meaning that the distance between every two distinct points is a positive number, while the distance from any point to itself is zero. [12]

  3. Statistical distance - Wikipedia

    en.wikipedia.org/wiki/Statistical_distance

    A metric on a set X is a function (called the distance function or simply distance) d : X × X → R + (where R + is the set of non-negative real numbers). For all x, y, z in X, this function is required to satisfy the following conditions: d(x, y) ≥ 0 (non-negativity) d(x, y) = 0 if and only if x = y (identity of indiscernibles.

  4. Distance from a point to a line - Wikipedia

    en.wikipedia.org/wiki/Distance_from_a_point_to_a...

    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.

  5. Distance - Wikipedia

    en.wikipedia.org/wiki/Distance

    In a grid plan, the travel distance between street corners is given by the Manhattan distance: the number of east–west and north–south blocks one must traverse to get between those two points. Chessboard distance, formalized as Chebyshev distance, is the minimum number of moves a king must make on a chessboard in order to travel between two ...

  6. Hamming distance - Wikipedia

    en.wikipedia.org/wiki/Hamming_distance

    In information theory, the Hamming distance between two strings or vectors of equal length is the number of positions at which the corresponding symbols are different. In other words, it measures the minimum number of substitutions required to change one string into the other, or equivalently, the minimum number of errors that could have transformed one string into the other.

  7. Distance between two parallel lines - Wikipedia

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

    The distance between two parallel lines in the plane is the minimum distance between any two points. Formula and proof ... “JUST THE MATHS” - UNIT NUMBER 8.5 ...

  8. Similarity measure - Wikipedia

    en.wikipedia.org/wiki/Similarity_measure

    The Euclidean distance formula is used to find the distance between two points on a plane, which is visualized in the image below. Manhattan distance is commonly used in GPS applications, as it can be used to find the shortest route between two addresses. [citation needed] When you generalize the Euclidean distance formula and Manhattan ...

  9. Taxicab geometry - Wikipedia

    en.wikipedia.org/wiki/Taxicab_geometry

    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. The taxicab distance is also sometimes known as rectilinear distance or L 1 distance (see L p space). [1]