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

  4. Great-circle distance - Wikipedia

    en.wikipedia.org/wiki/Great-circle_distance

    A diagram illustrating great-circle distance (drawn in red) between two points on a sphere, P and Q. Two antipodal points, u and v are also shown. The great-circle distance, orthodromic distance, or spherical distance is the distance between two points on a sphere, measured along the great-circle arc between them. This arc is the shortest path ...

  5. Euclidean distance - Wikipedia

    en.wikipedia.org/wiki/Euclidean_distance

    Formulas for computing distances between different types of objects include: The distance from a point to a line, in the Euclidean plane [8] The distance from a point to a plane in three-dimensional Euclidean space [8] The distance between two lines in three-dimensional Euclidean space [9]

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

    en.wikipedia.org/wiki/Distance

    The distance between two points in physical space is the length of a straight line between them, which is the shortest possible path. This is the usual meaning of distance in classical physics, including Newtonian mechanics. Straight-line distance is formalized mathematically as the Euclidean distance in two-and three-dimensional space.

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

  9. Brachistochrone curve - Wikipedia

    en.wikipedia.org/wiki/Brachistochrone_curve

    The curve of fastest descent is not a straight or polygonal line (blue) but a cycloid (red).. In physics and mathematics, a brachistochrone curve (from Ancient Greek βράχιστος χρόνος (brákhistos khrónos) ' shortest time '), [1] or curve of fastest descent, is the one lying on the plane between a point A and a lower point B, where B is not directly below A, on which a bead ...