C++ implementation of Fortune algorithm for Voronoi diagram construction
-
Updated
Oct 6, 2019 - C++
C++ implementation of Fortune algorithm for Voronoi diagram construction
Fast polyline (line segments) intersection (fast version of bentley-ottmann and more than that)
A B-Tree implementation of sweep line algorithm for segment intersection
Fortune's Algorithm O(N log N) for ICPC
My own implementation of classical computational geometry algorithms on diverse languages.
Add a description, image, and links to the sweep-line topic page so that developers can more easily learn about it.
To associate your repository with the sweep-line topic, visit your repo's landing page and select "manage topics."