Skip to search formSkip to main content
You are currently offline. Some features of the site may not work correctly.

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… Expand
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2009
2009
This paper presents an agglomerative hierarchical clustering algorithm for spatial data. It discovers clusters of arbitrary… Expand
Is this relevant?
Highly Cited
2007
Highly Cited
2007
Recent research has focused on systems for obtaining automatic 3D reconstructions of urban environments from video acquired at… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
2005
Highly Cited
2005
We introduce a geometric transformation that allows Voronoi diagrams to be computed using a sweepline technique. The… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 3.1
  • figure 3.2
Is this relevant?
Highly Cited
2003
Highly Cited
2003
Carbon nanotube field-effect transistors commonly comprise nanotubes lying on SiO2 surfaces exposed to the ambient environment… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
1999
1999
We propose a new thinning algorithm based on line sweep operation. Assuming that the contour of the figure to be thinned has been… Expand
Is this relevant?
Highly Cited
1990
Highly Cited
1990
Abstract : Pre-processing some building models can radically reduce the number of polygons processed during interactive building… Expand
  • figure 1.1
  • figure 1.2
  • figure 1.3
  • figure 1.4
  • figure 1.5
Is this relevant?
Highly Cited
1989
Highly Cited
1989
The authors consider the problem of planning paths for a robot which has a minimum turning radius. This is a first step towards… Expand
Is this relevant?
Highly Cited
1986
Highly Cited
1986
We present a transformation that can be used to compute Voronoi diagrams with a sweepline technique. The transformation is used… Expand
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 3.1
  • figure 3.2
Is this relevant?
Highly Cited
1985
Highly Cited
1985
Let D be a dynamic set of ordered pairs $[ x,y ]$ over the set $0,1, \cdots ,k - 1$ of integers. Consider the following… Expand
  • figure 2
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Algorithms in computational geometry are of increasing importance in computer-aided design, for example, in the layout of… Expand
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?