Line–line intersection in the context of "Collision detection"

Play Trivia Questions online!

or

Skip to study material about Line–line intersection in the context of "Collision detection"




⭐ Core Definition: Line–line intersection

In Euclidean geometry, the intersection of a line and a line can be the empty set, a single point, or a line (if they coincide). Distinguishing these cases and finding the intersection have uses, for example, in computer graphics, motion planning, and collision detection.

In a Euclidean space, if two lines are not coplanar, they have no point of intersection and are called skew lines. If they are coplanar, however, there are three possibilities: if they coincide (are the same line), they have all of their infinitely many points in common; if they are distinct but have the same direction, they are said to be parallel and have no points in common; otherwise, they have a single point of intersection, denoted as singleton set, for instance .

↓ Menu

In this Dossier

Line–line intersection in the context of Intersection (geometry)

In geometry, an intersection between geometric objects (seen as sets of points) 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 line–line intersection between two distinct lines, which either is one point (sometimes called a vertex) or does not exist (if the lines are parallel). Other types of geometric intersection include:

Determination of the intersection of flats – linear geometric objects embedded in a higher-dimensional space – is a simple task of linear algebra, namely the solution of a system of linear equations. In general the determination of an intersection leads to non-linear equations, which can be solved numerically, for example using Newton iteration. Intersection problems between a line and a conic section (circle, ellipse, parabola, etc.) or a quadric (sphere, cylinder, hyperboloid, etc.) lead to quadratic equations that can be easily solved. Intersections between quadrics lead to quartic equations that can be solved algebraically.

↑ Return to Menu

Line–line intersection in the context of Intersection (Euclidean geometry)

In geometry, an intersection between geometric objects (seen as sets of points) 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 line–line intersection between two distinct lines, which either is one point (sometimes called a vertex) or empty (if the lines are parallel). Other types of geometric intersection include:

Determination of the intersection of flats – linear geometric objects embedded in a higher-dimensional space – is a simple task of linear algebra, namely the solution of a system of linear equations. In general the determination of an intersection leads to non-linear equations, which can be solved numerically, for example using Newton iteration. Intersection problems between a line and a conic section (circle, ellipse, parabola, etc.) or a quadric (sphere, cylinder, hyperboloid, etc.) lead to quadratic equations that can be easily solved. Intersections between quadrics lead to quartic equations that can be solved algebraically.

↑ Return to Menu