Sweep line algorithm: Difference between revisions

Content deleted Content added
m v2.03b - WP:WCW project (Template contains useless word template:)
No edit summary
Tag: Reverted
Line 4:
 
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.
,..
 
==History==
This approach may be traced to [[scanline algorithm]]s of rendering in [[computer graphics]], followed by exploiting this approach in early algorithms of [[integrated circuit layout]] design, in which a geometric description of an IC was processed in parallel strips, because the entire description could not fit into memory.{{Citation needed|date=May 2009}}