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