Skip to search formSkip to main contentSkip to account menu

Line–line intersection

Known as: Line-line intersection, Intersection of two lines, Two intersecting lines 
In Euclidean geometry, the intersection of a line and a line can be the empty set, a point, or a line. Distinguishing these cases and finding the… 
Wikipedia (opens in a new tab)

Related topics

Related topics

7 relations
Bézier curveCollision detectionComputer graphicsLine segment intersection

Broader (1)

Linear algebra

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
Highly Cited
2017
Highly Cited
2017
2-Line Exhaustive Searching for Real-Time Vanishing Point Estimation in Manhattan World
This paper presents a very simple and efficient algorithm to estimate 1, 2 or 3 orthogonal vanishing point(s) on a calibrated… 
Highly Cited
2006
Highly Cited
2006
Link Dynamics and Protocol Design in a Multihop Mobile Environment
A multihop ad hoc network with mobile elements is considered. A model is created and analytic expressions derived to characterize… 
Highly Cited
2006
Highly Cited
2006
New approach for target locations in the presence of wall ambiguities
A technique for target location estimation in through-the-wall radar imaging applications is presented. The algorithm corrects… 
Highly Cited
2005
Highly Cited
2005
Algorithms for fast concurrent reconfiguration of hexagonal metamorphic robots
The problem addressed is the distributed reconfiguration of a system of hexagonal metamorphic robots (modules) from an initial… 
Highly Cited
2003
Highly Cited
2003
Dynamic maintenance and visualization of molecular surfaces
Highly Cited
2001
Highly Cited
2001
Local analysis for 3D reconstruction of specular surfaces
We explore the geometry linking the shape of a curved mirror surface to the distortions it produces on a scene it reflects. Our… 
1999
1999
Intersection Test for Collision Detection in Particle Systems
Abstract We present a method for detecting collisions between a system of spherical particles and an environment composed of… 
Highly Cited
1999
Highly Cited
1999
Temporal Representation and Event Dating
Highly Cited
1997
Highly Cited
1997
Design for Quality-in-use: Human-Computer Interaction Meets Information Systems Development
1989
1989
An algorithm for computing the union, intersection or difference of two polygons
By clicking accept or continuing to use the site, you agree to the terms outlined in our Privacy Policy (opens in a new tab), Terms of Service (opens in a new tab), and Dataset License (opens in a new tab)