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.
Highly Cited
2010
Highly Cited
2010
Tillage effects on soil water redistribution and bare soil evaporation throughout a season
2010
2010
Self-Consistent Technique for Extracting Density of States in Amorphous InGaZnO Thin Film Transistors
The self-consistent technique for extracting density of states [DOS: g(E)] in an amorphous indium gallium zinc oxide (a-IGZO… 
Highly Cited
2008
Highly Cited
2008
Sweep‐line algorithm for constrained Delaunay triangulation
This paper introduces a new algorithm for constrained Delaunay triangulation, which is built upon sets of points and constraining… 
Highly Cited
2003
Highly Cited
2003
Hysteresis caused by water molecules in carbon nanotube field-effect transistors
Carbon nanotube field-effect transistors commonly comprise nanotubes lying on SiO2 surfaces exposed to the ambient environment… 
Highly Cited
2003
Highly Cited
2003
Influence of Mobile Ions on Nanotube Based FET Devices
Carbon nanotube field-effect transistors often exhibit a hysteresis effect in the gate-voltage dependence. We report devices… 
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… 
Highly Cited
2000
Highly Cited
2000
Tool-path planning for direction-parallel area milling
Review
2000
Review
2000
Review of Computational Geometry: Algorithms and Applications (2nd ed.) by Mark de Berg, Marc van Kreveld, Mark Overmars, and Otfried Schwarzkopf
Computational Geometry is a wide-ranging introductory text which exposes readers to the main themes in modern computational… 
Highly Cited
1997
Highly Cited
1997
Efficient view maintenance at data warehouses
We present incremental view maintenance algorithms for a data warehouse derived from multiple distributed autonomous data sources… 
Highly Cited
1990
Highly Cited
1990
Increasing update rates in the building walkthrough system with automatic model-space subdivision and potentially visible set calculations
Abstract : Pre-processing some building models can radically reduce the number of polygons processed during interactive building… 
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)