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)

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2008
2008
This paper reports on a high-speed, wide-range, wavelength-swept laser operating at 1310 nm with highly linear sweep performance… 
2005
2005
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
We show that determining the minimum number of resolve filters that need to be added to a set of two-dimensional (2-D) prefix… 
2003
2003
A computational parametric study of three-dimensional, sidewall-compression scramjet inlets was performed to identify the effects… 
2002
2002
This paper presents an efficient line-offset algorithm for general polygonal shapes with islands. A developed sweep- line… 
2002
2002
We introduce a novel algorithm for solving the nearest neighbour problem when the query points are known in advance, which is… 
1993
1993
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
  • P.-Y. HsiaoW. Feng
  • 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
The study of parallelism in computational geometry has been largely confined to individual case studies and isolated results with…