When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Intersecting chords theorem - Wikipedia

    en.wikipedia.org/wiki/Intersecting_chords_theorem

    The value of the two products in the chord theorem depends only on the distance of the intersection point S from the circle's center and is called the absolute value of the power of S; more precisely, it can be stated that: | | | | = | | | | = where r is the radius of the circle, and d is the distance between the center of the circle and the ...

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

  4. Chord (geometry) - Wikipedia

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

    Ptolemy used a circle of diameter 120, and gave chord lengths accurate to two sexagesimal (base sixty) digits after the integer part. [2] The chord function is defined geometrically as shown in the picture. The chord of an angle is the length of the chord between two points on a unit circle separated by that central angle.

  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. 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 of closest approach - Wikipedia

    en.wikipedia.org/wiki/Distance_of_closest_approach

    Consider two ellipsoids, each with a given shape and orientation, whose centers are on a line with given direction. We wish to determine the distance between centers when the ellipsoids are in point contact externally. This distance of closest approach is a function of the shapes of the ellipsoids and their orientation.

  8. Euclidean minimum spanning tree - Wikipedia

    en.wikipedia.org/wiki/Euclidean_minimum_spanning...

    In it, any two points can reach each other along a path through the line segments. It can be found as the minimum spanning tree of a complete graph with the points as vertices and the Euclidean distances between points as edge weights. The edges of the minimum spanning tree meet at angles of at least 60°, at most six to a vertex.

  9. Constructible number - Wikipedia

    en.wikipedia.org/wiki/Constructible_number

    The square root of 2 is equal to the length of the hypotenuse of a right triangle with legs of length 1 and is therefore a constructible number. In geometry and algebra, a real number is constructible if and only if, given a line segment of unit length, a line segment of length | | can be constructed with compass and straightedge in a finite number of steps.