A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.
-
Updated
Nov 24, 2024 - JavaScript
A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.
Computes border of unification of multiple rectangles
Computes and highlights the maximum sum of a list of signed integers
Computes intersections of multiple horizontal and vertical lines
Computes closest pairs of points
Add a description, image, and links to the sweep-line-algorithm topic page so that developers can more easily learn about it.
To associate your repository with the sweep-line-algorithm topic, visit your repo's landing page and select "manage topics."