When.com Web Search

Search results

  1. Results From The WOW.Com Content Network
  2. Intersection (geometry) - Wikipedia

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

    intersection of two polygons: window test. If one wants to determine the intersection points of two polygons, one can check the intersection of any pair of line segments of the polygons (see above). For polygons with many segments this method is rather time-consuming. In practice one accelerates the intersection algorithm by using window tests ...

  3. Special cases of Apollonius' problem - Wikipedia

    en.wikipedia.org/wiki/Special_cases_of_Apollonius...

    In general, the same inversion transforms the given line L and given circle C into two new circles, c 1 and c 2. Thus, the problem becomes that of finding a solution line tangent to the two inverted circles, which was solved above. There are four such lines, and re-inversion transforms them into the four solution circles of the Apollonius problem.

  4. Tangent lines to circles - Wikipedia

    en.wikipedia.org/wiki/Tangent_lines_to_circles

    Let O 1 and O 2 be the centers of the two circles, C 1 and C 2 and let r 1 and r 2 be their radii, with r 1 > r 2; in other words, circle C 1 is defined as the larger of the two circles. Two different methods may be used to construct the external and internal tangent lines. External tangents Construction of the outer tangent

  5. Intersection curve - Wikipedia

    en.wikipedia.org/wiki/Intersection_curve

    The intersection of two planes. The analytic determination of the intersection curve of two surfaces is easy only in simple cases; for example: a) the intersection of two planes, b) plane section of a quadric (sphere, cylinder, cone, etc.), c) intersection of two quadrics in special cases. For the general case, literature provides algorithms ...

  6. Line–line intersection - Wikipedia

    en.wikipedia.org/wiki/Line–line_intersection

    Assume that we want to find intersection of two infinite lines in 2-dimensional space, defined as a 1 x + b 1 y + c 1 = 0 and a 2 x + b 2 y + c 2 = 0. We can represent these two lines in line coordinates as U 1 = (a 1, b 1, c 1) and U 2 = (a 2, b 2, c 2). The intersection P′ of two lines is then simply given by [4]

  7. Intersecting chords theorem - Wikipedia

    en.wikipedia.org/wiki/Intersecting_chords_theorem

    In Euclidean geometry, the intersecting chords theorem, or just the chord theorem, is a statement that describes a relation of the four line segments created by two intersecting chords within a circle. It states that the products of the lengths of the line segments on each chord are equal. It is Proposition 35 of Book 3 of Euclid's Elements.

  8. Monge's theorem - Wikipedia

    en.wikipedia.org/wiki/Monge's_theorem

    For any two circles in a plane, an external tangent is a line that is tangent to both circles but does not pass between them. There are two such external tangent lines for any two circles. Each such pair has a unique intersection point in the extended Euclidean plane. Monge's theorem states that the three such points given by the three pairs of ...

  9. Navigational algorithms - Wikipedia

    en.wikipedia.org/wiki/Navigational_Algorithms

    The navigational algorithms are the quintessence of the executable software on portable calculators or smartphones as an aid to the art of navigation, this attempt article describe both algorithms and software for smartphones implementing different calculation procedures for navigation. The calculation power obtained by the languages—Basic, C ...