enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Euclidean distance - Wikipedia

    en.wikipedia.org/wiki/Euclidean_distance

    Minkowski distance (L p distance), a generalization that unifies Euclidean distance, taxicab distance, and Chebyshev distance. For points on surfaces in three dimensions, the Euclidean distance should be distinguished from the geodesic distance, the length of a shortest curve that belongs to the surface.

  3. Euclidean distance matrix - Wikipedia

    en.wikipedia.org/wiki/Euclidean_distance_matrix

    In mathematics, a Euclidean distance matrix is an n×n matrix representing the spacing of a set of n points in Euclidean space. For points x 1 , x 2 , … , x n {\displaystyle x_{1},x_{2},\ldots ,x_{n}} in k -dimensional space ℝ k , the elements of their Euclidean distance matrix A are given by squares of distances between them.

  4. Distance from a point to a plane - Wikipedia

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

    In Euclidean space, the distance from a point to a plane is the distance between a given point and its orthogonal projection on the plane, ...

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

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

  7. Euclidean geometry - Wikipedia

    en.wikipedia.org/wiki/Euclidean_geometry

    defining the distance between two points P = (p x, p y) and Q = (q x, q y) is then known as the Euclidean metric, and other metrics define non-Euclidean geometries. In terms of analytic geometry, the restriction of classical geometry to compass and straightedge constructions means a restriction to first- and second-order equations, e.g., y = 2 ...

  8. Euclidean space - Wikipedia

    en.wikipedia.org/wiki/Euclidean_space

    The distance (more precisely the Euclidean distance) between two points of a Euclidean space is the norm of the translation vector that maps one point to the other; that is d ( P , Q ) = ‖ P Q → ‖ .

  9. Cylindrical coordinate system - Wikipedia

    en.wikipedia.org/wiki/Cylindrical_coordinate_system

    The radial distance ρ is the Euclidean distance from the z-axis to the point P. The azimuth φ is the angle between the reference direction on the chosen plane and the line from the origin to the projection of P on the plane. The axial coordinate or height z is the signed distance from the chosen plane to the point P.