Line Intersections: Revision history

Jump to navigation Jump to search

Diff selection: Mark the radio buttons of the revisions to compare and hit enter or the button at the bottom.
Legend: (cur) = difference with latest revision, (prev) = difference with preceding revision, m = minor edit.

    10 October 2022

    • curprev 10:5810:58, 10 October 2022‎ Admin talk contribs‎ 2,048 bytes +2,048‎ Created page with "== Problem Description== Lines that are non-coincident and non-parallel intersect at a unique point. Lines are said to intersect each other if they cut each other at a point. By Euclid's lemma two lines can have at most 11 point of intersection. To find the intersection of two lines, you first need the equation for each line. At the intersection, xx and yy have the same value for each equation. This means that the equations are equal to each other. We can therefore sol..."
Retrieved from "https://algorithm-wiki.csail.mit.edu/wiki/Line_Intersections"