When.com Web Search

Search results

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

    en.wikipedia.org/wiki/Euclidean_distance

    The distance between any two points on the real line is the absolute value of the numerical difference of their coordinates, their absolute difference.Thus if and are two points on the real line, then the distance between them is given by: [1]

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

  4. Distance from a point to a line - Wikipedia

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

    The distance from (x 0, y 0) to this line is measured along a vertical line segment of length |y 0 - (-c/b)| = |by 0 + c| / |b| in accordance with the formula. Similarly, for vertical lines (b = 0) the distance between the same point and the line is |ax 0 + c| / |a|, as measured along a horizontal line segment.

  5. Geographical distance - Wikipedia

    en.wikipedia.org/wiki/Geographical_distance

    Geographical distance or geodetic distance is the distance measured along the surface of the Earth, or the shortest arch length. The formulae in this article calculate distances between points which are defined by geographical coordinates in terms of latitude and longitude. This distance is an element in solving the second (inverse) geodetic ...

  6. Nearest neighbor search - Wikipedia

    en.wikipedia.org/wiki/Nearest_neighbor_search

    The absolute distance is not required for distance comparison, only the relative distance. In geometric coordinate systems the distance calculation can be sped up considerably by omitting the square root calculation from the distance calculation between two coordinates. The distance comparison will still yield identical results.

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

  8. Haversine formula - Wikipedia

    en.wikipedia.org/wiki/Haversine_formula

    d is the distance between the two points along a great circle of the sphere (see spherical distance), r is the radius of the sphere. The haversine formula allows the haversine of θ to be computed directly from the latitude (represented by φ) and longitude (represented by λ) of the two points:

  9. Distance from a point to a plane - Wikipedia

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

    In either the coordinate or vector formulations, one may verify that the given point lies on the given plane by plugging the point into the equation of the plane. To see that it is the closest point to the origin on the plane, observe that p {\displaystyle \mathbf {p} } is a scalar multiple of the vector v {\displaystyle \mathbf {v} } defining ...