When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. 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 .

  3. 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.

  4. Parallel (geometry) - Wikipedia

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

    Because parallel lines in a Euclidean plane are equidistant there is a unique distance between the two parallel lines. Given the equations of two non-vertical, non-horizontal parallel lines, = + = +, the distance between the two lines can be found by locating two points (one on each line) that lie on a common perpendicular to the parallel lines ...

  5. Linear interpolation - Wikipedia

    en.wikipedia.org/wiki/Linear_interpolation

    Linear interpolation on a data set (red points) consists of pieces of linear interpolants (blue lines). Linear interpolation on a set of data points (x 0, y 0), (x 1, y 1), ..., (x n, y n) is defined as piecewise linear, resulting from the concatenation of linear segment interpolants between each pair of data points.

  6. 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 ...

  7. Hausdorff distance - Wikipedia

    en.wikipedia.org/wiki/Hausdorff_distance

    The Hausdorff distance is the longest distance someone can be forced to travel by an adversary who chooses a point in one of the two sets, from where they then must travel to the other set. In other words, it is the greatest of all the distances from a point in one set to the closest point in the other set.

  8. Vincenty's formulae - Wikipedia

    en.wikipedia.org/wiki/Vincenty's_formulae

    Vincenty's formulae are two related iterative methods used in geodesy to calculate the distance between two points on the surface of a spheroid, developed by Thaddeus Vincenty (1975a). They are based on the assumption that the figure of the Earth is an oblate spheroid, and hence are more accurate than methods that assume a spherical Earth, such ...

  9. Line (geometry) - Wikipedia

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

    [1]: 300 In two dimensions (i.e., the Euclidean plane), two lines that do not intersect are called parallel. In higher dimensions, two lines that do not intersect are parallel if they are contained in a plane, or skew if they are not. On a Euclidean plane, a line can be represented as a boundary between two regions.