enow.com Web Search

Search results

  1. Results from the WOW.Com Content Network
  2. Line–line intersection - Wikipedia

    en.wikipedia.org/wiki/Lineline_intersection

    Two intersecting lines. In Euclidean geometry, the intersection of a line and a line can be the empty set, a point, or another line.Distinguishing these cases and finding the intersection have uses, for example, in computer graphics, motion planning, and collision detection.

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

  4. Intersection (geometry) - Wikipedia

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

    In geometry, an intersection is a point, line, or curve common to two or more objects (such as lines, curves, planes, and surfaces). The simplest case in Euclidean geometry is the lineline intersection between two distinct lines , which either is one point (sometimes called a vertex ) or does not exist (if the lines are parallel ).

  5. Concurrent lines - Wikipedia

    en.wikipedia.org/wiki/Concurrent_lines

    For example, the first Napoleon point is the point of concurrency of the three lines each from a vertex to the centroid of the equilateral triangle drawn on the exterior of the opposite side from the vertex. A generalization of this notion is the Jacobi point. The de Longchamps point is the point of concurrence of several lines with the Euler line.

  6. Multiple line segment intersection - Wikipedia

    en.wikipedia.org/wiki/Multiple_line_segment...

    The Shamos–Hoey algorithm [1] applies this principle to solve the line segment intersection detection problem, as stated above, of determining whether or not a set of line segments has an intersection; the Bentley–Ottmann algorithm works by the same principle to list all intersections in logarithmic time per intersection.

  7. Line at infinity - Wikipedia

    en.wikipedia.org/wiki/Line_at_infinity

    The line at infinity is added to the real plane. This completes the plane, because now parallel lines intersect at a point which lies on the line at infinity. Also, if any pair of lines do not intersect at a point on the line, then the pair of lines are parallel. Every line intersects the line at infinity at some point.

  8. Intercept theorem - Wikipedia

    en.wikipedia.org/wiki/Intercept_theorem

    The intercept theorem, also known as Thales's theorem, basic proportionality theorem or side splitter theorem, is an important theorem in elementary geometry about the ratios of various line segments that are created if two rays with a common starting point are intercepted by a pair of parallels.

  9. 99 Points of Intersection - Wikipedia

    en.wikipedia.org/wiki/99_Points_of_Intersection

    Some of these points of intersection are standard; for instance, these include the construction of the centroid of a triangle as the point where its three median lines meet, the construction of the orthocenter as the point where the three altitudes meet, and the construction of the circumcenter as the point where the three perpendicular ...