Sweep line algorithm: Difference between revisions

Content deleted Content added
m math formatting
Tags: Mobile edit Mobile app edit iOS app edit
Replaced animation with a more sophisticated version for better illustration
Line 1:
{{Short description|Class of algorithms which use a moving line to solve geometrical problems}}
[[File:FortunesSweep-line-algorithm.gif|frame|right|Animation of [[Fortune's algorithm]], a sweep line technique for constructing [[Voronoi diagram]]s.]]
 
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.