Content deleted Content added
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]]. It has also been used for performance bottleneck detection from the parallel applications' event logs.<ref>{{cite web|title=A Zoom-in Analysis of I/O Logs to Detect Root Causes of I/O Performance Bottlenecks|url=https://ieeexplore.ieee.org/document/8752753/|publisher=IEEE|format=PDF|date=May 2019}}</ref><ref>{{cite web|title=IOMiner: Large-Scale Analytics Framework for Gaining Knowledge from I/O Logs|url=https://ieeexplore.ieee.org/document/8514906/|publisher=IEEE|format=PDF|date=Dec 2012}}</ref>
==Generalizations and extensions==
| |||