Revision as of 18:02, 25 August 2019 edit Biohog (talk \| contribs) 14 edits add typical use case for sweep line ← Previous edit		Revision as of 18:05, 25 August 2019 edit undo Biohog (talk \| contribs) 14 edits Undid revision 912452848, not a representative use case Tag: Undo Next edit →
Line 22: \| year = 2008}}.</ref> Since then, this approach has been used to design efficient algorithms for a number of problems, such as construction of the [[Voronoi diagram]] ([[Fortune's algorithm]]), and the [[Delaunay triangulation]], or [[boolean operations on polygons]] and I/O log analysis<ref>{{cite web\|title=Analysis and Correlation of Application I/O Performance and System-Wide I/O Activity\|url=https://ieeexplore.ieee.org/document/8026844/\|publisher=IEEE\|format=PDF\|date=Aug 2017}}</ref> . ==Generalizations and extensions==

Sweep line algorithm: Difference between revisions