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.
C++ implementation of Fortune algorithm for Voronoi diagram construction
Detection of line segments & polygon edges intersections
Pure Python implementation of a sweep line algorithm for line-segment intersections, based on a paper by Mehlhorn and Näher.
Fortune's algorithm described in coq
Solution to 2012 ACM-ICPC World Finals problem: A Safe Bet
Sweep Line algorithm for segments intersection
Python implementation of Steven Fortune's sweep line algorithm for voronoi graph computation
Computes and highlights the maximum sum of a list of signed integers
Computes border of unification of multiple rectangles
A 2D linear classifier that wraps each group of points in a tight shape and then draws a separating line
Geometric algorithms course at AGH UST. This repository contains labs solutions (mainly geometric algorithms implementations, but also time tests etc.) and reports. Algorithms are written in Python.
Computes intersections of multiple horizontal and vertical lines
A sweep line algorithm which finds all the intersection points in a layer of wires.
Implementation of Sweep Line Algorithm on Java
A B-Tree implementation of sweep line algorithm for segment intersection
Geometric Alghoritms Project of @usi 20/21
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."