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… (More)
Wikipedia

Papers overview

Semantic Scholar uses AI to extract papers important to this topic.
2014
2014
One of the most representative and studied Distance-Based Queries in Spatial Databases is the K-Closest-Pairs Query (KCPQ). This… (More)
  • figure 1
  • table 1
  • table 2
  • figure 2
  • table 3
Is this relevant?
2012
2012
Let P ⊂ R be a set of n points. In [1] and [2] an algorithm for counting triangulations and pseudo-triangulations of P… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2008
2008
Sensing is one of the fundamental functions of wireless sensor networks. Sensor networks are designed to conduct monitoring of… (More)
  • figure 1
  • figure 3
  • figure 2
  • figure 7
  • figure 4
Is this relevant?
2007
2007
The Bentley Ottmann sweep line algorithm is a standard tool to compute the arrangement of algebraic curves in the plane. If… (More)
Is this relevant?
2002
2002
We introduce a novel algorithm for solving the nearest neighbour problem when the query points are known in advance, which is… (More)
  • figure 1
  • figure 3
  • figure 5
  • figure 6
Is this relevant?
2002
2002
We introduce a novel algorithm for solving the nearest neighbour problem when the query points are known in advance, which is… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
2002
2002
The recently developed sweep-line method exploits progress present in many concurrent systems to explore the full state space of… (More)
Is this relevant?
1997
1997
Lazy Sweep Ray Casting is a fast algorithm for rendering general irregular grids. It is based on the sweep-plane paradigm, and it… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?
Highly Cited
1987
Highly Cited
1987
We introduce a geometric transformation that allows Voronoi diagrams to be computed using a sweepline technique. The… (More)
  • figure 2.1
  • figure 2.2
  • figure 2.3
  • figure 3.1
  • figure 3.2
Is this relevant?
Highly Cited
1982
Highly Cited
1982
Algorithms in computational geometry are of increasing importace in computer-aided design, for example, in the layout of… (More)
  • figure 1
  • figure 2
  • figure 3
  • figure 4
  • figure 5
Is this relevant?