Sweeping Lines Terminal Screensaver
-
Updated
Mar 10, 2018 - Shell
Sweeping Lines Terminal Screensaver
Golang package for generation of voronoi diagrams with Fortune's algorithm
C++ implementation of Fortune algorithm for Voronoi diagram construction
Fortune's Algorithm O(N log N) for ICPC
A swift implementation of Fortune's Algorithm to generate Voronoi Diagrams
Sweep Line algorithm for segments intersection
Java implementation of Bentley-Ottmann segments intersection finding algorithm
simple Java implementation of Bentley-Ottmann sweep line algorithm for listing all intersections in a set of line segments
Pure Python implementation of a sweep line algorithm for line-segment intersections, based on a paper by Mehlhorn and Näher.
My own implementation of classical computational geometry algorithms on diverse languages.
Fast polyline (line segments) intersection (fast version of bentley-ottmann and more than that)
Python implementation of Steven Fortune's sweep line algorithm for voronoi graph computation
Implementation of Sweep Line Algorithm on Java
A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.
A B-Tree implementation of sweep line algorithm for segment intersection
Segments intersection detection library
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."