Skip to search formSkip to main contentSkip to account menu

Sweep line algorithm

Known as: Sweepline, Plane sweep, Sweep 
In computational geometry, a sweep line algorithm or plane sweep algorithm is an algorithmic paradigm that uses a conceptual sweep line or sweep… 
Wikipedia (opens in a new tab)

Related topics

Related topics

18 relations
Algorithmic paradigmAnalysis of algorithmsBentley–Ottmann algorithmBoolean operations on polygons

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2005
2005
Wall Walker: Proposal of Locomotion Mechanism Cleaning Even at the Corner
The purpose of this research is to develop the window cleaning robot for cleaning a single large windowpane such as a show window… 
2005
2005
Conflict detection and resolution in two-dimensional prefix router tables
We show that determining the minimum number of resolve filters that need to be added to a set of two-dimensional (2-D) prefix… 
2005
2005
Sweep-Line Analysis of TCP Connection Management
Despite the widespread use of the Transmission Control Protocol (TCP) as the main transport protocol in the Internet, the… 
2003
2003
Computational Parametric Study of Sidewall-Compression Scramjet Inlet Performance at Mach 10
A computational parametric study of three-dimensional, sidewall-compression scramjet inlets was performed to identify the effects… 
2002
2002
A Sweep-Line Algorithm and Its Application to Spiral Pocketing
This paper presents an efficient line-offset algorithm for general polygonal shapes with islands. A developed sweep- line… 
2002
2002
A sweep line algorithm for nearest neighbour queries
We introduce a novel algorithm for solving the nearest neighbour problem when the query points are known in advance, which is… 
Highly Cited
1996
Highly Cited
1996
Variations on sweep algorithms: efficient computation of extended viewsheds and class intervals
Two novel applications of the plane sweep paradigm are demonstrated, namely, for the computation of extended viewsheds on gridded… 
1993
1993
Trace Size vs. Parallelism in Trace-and-Replay Debugging of Shared-Memory Programs
Execution replay is a debugging strategy in which a program is run over and over on an input that manifests bugs. For explicitly… 
1990
1990
Using a multiple storage quad tree on a hierarchical VLSI compaction scheme
  • P.-Y. HsiaoW. Feng
  • IEEE Trans. Comput. Aided Des. Integr. Circuits…
  • 1990
  • Corpus ID: 22805540
A graph-generating algorithm and the experimental results of a hierarchical mask-layout-compaction scheme based on a plane-sweep… 
1987
1987
Parallel processing for efficient subdivision search
The study of parallelism in computational geometry has been largely confined to individual case studies and isolated results with… 
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)