Sweep line algorithm: Difference between revisions

Revision as of 17:33, 26 May 2015

Revision as of 20:11, 24 August 2016

Line 1:

[[File:Fortunes-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 aan type[[algorithmic of algorithmparadigm]] that uses a conceptual ''sweep line'' or ''sweep surface'' to solve various problems in [[Euclidean space]]. It is one of the key techniques in computational geometry.

The idea behind algorithms of this type is to imagine that a line (often a vertical line) is swept or moved across the plane, stopping at some points. Geometric operations are restricted to geometric objects that either intersect or are in the immediate vicinity of the sweep line whenever it stops, and the complete solution is available once the line has passed over all objects.