Live briefing
Everything about Sweep line algorithm
Class of algorithms which use a moving line to solve geometrical problems
In computational geometry, a sweep line algorithm or plane sweep algorithm is an algorithmic paradigm that uses a conceptual sweep line or sweep surface to solve various problems in Euclidean space. It is one of the critical techniques in computational geometry. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Sweep line algorithmA 5-minute orientation
- Skim a recent paper: Focusing of Wide-Swath Range Sweep SAR With Extended Wide Nonlinear Chirp Scaling AlgorithmInfluential work since 2022
- Pick up a classic book: Robot programmer's bonanzaThe most-reprinted book on the subject
- Read the landmark paper: Sweep‐line algorithm for constrained Delaunay triangulationCited 38 times
- Go sideways: Computational geometryA closely related topic
- Go sideways: Bentley–Ottmann algorithmA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Sweep‐line algorithm for constrained Delaunay triangulation
A fast line-sweep algorithm for hidden line elimination
An efficient sweep-line Delaunay triangulation algorithm
Feature analysis using line sweep thinning algorithm
A sweep-line algorithm for spatial clustering
An efficient algorithm for clipping operation based on trapezoidal meshes and sweep-line technique
A sweep-line algorithm for the inclusion hierarchy among circles
A novel approach for efficient resource allocation in 6G V2V networks using neighbor-aware greedy algorithm and sweep line model
🆕 Influential since 2022
Focusing of Wide-Swath Range Sweep SAR With Extended Wide Nonlinear Chirp Scaling Algorithm
Algorithm for partial sweep coverage on a line
PSEUDO-TRIANGULATION OF MONOTONE POLYGON USING SWEEP LINE ALGORITHM
Extended backward–forward sweep inverse power-flow algorithm for line parameters estimation in low-voltage grids
A Novel Approach for Efficient Resource Allocation in 6G V2V Networks using Neighbor-Aware Greedy Algorithm and Sweep Line Model
📚 Books worth reading
Robot programmer's bonanzaJohn Blankenship · 2008- 📕A fast line-sweep algorithm for hidden line eliminationOtto Nurmi · 1984
On vertical visibility in arrangements of segments and the queue size in the Bentley-Ottman line sweeping algorithmJános Pach · 1988
Geometric modellingIFIP TC5/WG5.2 International Workshop on Geometric Modelling (6th 1998 Tokyo, Japan) · 2001
প্রোগ্রামিং কনটেস্টমোঃ মাহবুবুল হাসান · 2016
How to guard an art gallery and other discrete mathematical adventuresT. S. Michael · 2009
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Computational geometry Computational geometry is a branch of computer science devoted to the study of algorithms that can be stated in terms of geometry. Some purely geometrical…
- Bentley–Ottmann algorithm In computational geometry, the Bentley–Ottmann algorithm is a sweep line algorithm for listing all crossings in a set of line segments, i.e. it finds the…
- Multiple line segment intersection In computational geometry, the multiple line segment intersection problem supplies a list of line segments in the Euclidean plane and asks whether any…
- Delaunay triangulation In computational geometry, a Delaunay triangulation or Delone triangulation of a set of points in the plane subdivides their convex hull into triangles…
- Rotating calipers In computational geometry, the method of rotating calipers is an algorithm design technique that can be used to solve optimization problems including finding…
- Proximity problems Proximity problems is a class of problems in computational geometry which involve estimation of distances between geometric objects. A subset of these…
- Point-set triangulation A triangulation of a set of points 𝒫 in the Euclidean space ℝd is a simplicial complex that covers the convex hull of 𝒫, and whose vertices belong to…
- List of books in computational geometry This is a list of books in computational geometry. There are two major, largely nonoverlapping categories: Combinatorial computational geometry, which…