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