Skip to search formSkip to main contentSkip to account menu

Line segment intersection

Known as: Intersection of line segments, Line intersection problem, Line segment intersection problem 
In computational geometry, the line segment intersection problem supplies a list of line segments in the Euclidean plane and asks whether any two of… 
Wikipedia (opens in a new tab)

Related topics

Related topics

9 relations
Bentley–Ottmann algorithmCGALComputational geometryIntroduction to Algorithms

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2012
2012
Detection quality of border surveillance wireless sensor networks in the existence of trespassers' favorite paths
2011
2011
Coordinated traffic scheduling for communicating mobile robots
In this paper, a multi-robot networking paradigm is presented. This provides a general framework for coordination among a group… 
2011
2011
Creating building ground plans via robust K-way union
Due to collaborative efforts and advances in data acquisition technology, a large volume of geometric models describing urban… 
2009
2009
A parallel line segment intersection strategy based on uniform grids
The line segment intersection problem is one of the basic problems in computational geometry and has been widely used in spatial… 
2008
2008
Cache-Oblivious Red-Blue Line Segment Intersection
We present an optimal cache-oblivious algorithm for finding all intersections between a set of non-intersecting red segments and… 
2006
2006
Red-Blue Sweep Line Algorithm Based on Monotone Chains for Connected Line Segment Intersection Problems
An improved Red/Blue sweep line algorithm is preserted for connected line segment intersection in GIS.First the algorithm breaks… 
2005
2005
Line-segment intersection made in-place
2003
2003
Implementatations of Algorithms For Line-Segment Intersection
In this paper, I analyze the constant factors for implementations of line segment intersection algorithms. I explore how these… 
2001
2001
Randomized External-Memory Algorithms for Line Segment Intersection and Other Geometric Problems
We show that the well-known random incremental construction of Clarkson and Shor18 can be adapted to provide efficient external… 
1987
1987
A bucketing algorithm for the orthogonal segment intersection search problem and its practical efficiency
The orthogonal segment intersection search problem is stated as follows: given a setS ofn orthogonal segments in the plane… 
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)