Line-line Intersection Ahmed Eldawy Given two straight lines, each represented by two points, there are three possible cases:

Line Segment Intersection Michael Goodrich Univ. of California, Irvine Some slides from CMPS 3130/6130 Computational Geometry, Spring 2015, by Carola Wenk

Bentley and Ottmann’s solution to segment intersection is a model illustration of the sweep-line paradigm. We make it the starting point of our investigation.

Whenever two line segments become adjacent along the sweep line (one immediately above the other), we will check whether they have an intersection occurring to the right of the sweep line.

This document describes an algorithm for computing the set of intersection between a cone and a line, ray or segment. The algorithm is theoretically correct when using real-valued arithmetic.

To determine algebraically whether or not a line intersects a plane, we may substitute the parametric equations of the line into the scalar equation of the plane The resulting linear equation reduces to …

In this lecture, I'll talk about detecting line segment intersections. A line segment is the convex hull of two points, called the endpoints (or vertices) of the segment.