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

  3. Distance between two parallel lines - Wikipedia

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

    the distance between the two lines is the distance between the two intersection points of these lines with the perpendicular line y = x / m . {\displaystyle y=-x/m\,.} This distance can be found by first solving the linear systems

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

  5. 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. [11] 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. [11]

  6. Taxicab geometry - Wikipedia

    en.wikipedia.org/wiki/Taxicab_geometry

    In taxicab geometry, the lengths of the red, blue, green, and yellow paths all equal 12, the taxicab distance between the opposite corners, and all four paths are shortest paths. Instead, in Euclidean geometry, the red, blue, and yellow paths still have length 12 but the green path is the unique shortest path, with length equal to the Euclidean ...

  7. Mean line segment length - Wikipedia

    en.wikipedia.org/wiki/Mean_line_segment_length

    In other words, it is the expected Euclidean distance between two random points, where each point in the shape is equally likely to be chosen. Even for simple shapes such as a square or a triangle, solving for the exact value of their mean line segment lengths can be difficult because their closed-form expressions can get quite complicated.

  8. Distance - Wikipedia

    en.wikipedia.org/wiki/Distance

    The distance between distinct objects is always positive. Distance is symmetric: the distance from x to y is always the same as the distance from y to x. Distance satisfies the triangle inequality: if x, y, and z are three objects, then (,) (,) + (,).

  9. Hesse normal form - Wikipedia

    en.wikipedia.org/wiki/Hesse_normal_form

    Distance from the origin O to the line E calculated with the Hesse normal form. Normal vector in red, line in green, point O shown in blue. In analytic geometry , the Hesse normal form (named after Otto Hesse ) is an equation used to describe a line in the Euclidean plane R 2 {\displaystyle \mathbb {R} ^{2}} , a plane in Euclidean space R 3 ...