A small module using a sweepline algorithm to detect intersections (& self-intersections) in polygons or polylines.
-
Updated
Nov 24, 2024 - JavaScript
#
sweep-line-algorithm
Here are 20 public repositories matching this topic...
C++ implementation of Fortune algorithm for Voronoi diagram construction
xcode cpp matplotlib voronoi-diagram fortune-algorithm dcel sweep-line sweep-line-algorithm doubly-connect
-
Updated
Oct 6, 2019 - C++
Detection of line segments & polygon edges intersections
-
Updated
Nov 13, 2023 - Python
Pure Python implementation of a sweep line algorithm for line-segment intersections, based on a paper by Mehlhorn and Näher.
-
Updated
Feb 18, 2022 - Python
Fortune's algorithm described in coq
coq computational-geometry coq-formalization voronoi-diagram formal-verification fortune-algorithm sweep-line-algorithm
-
Updated
Jun 6, 2019 - Coq
Solution to 2012 ACM-ICPC World Finals problem: A Safe Bet
-
Updated
May 19, 2019 - Python
Python implementation of Steven Fortune's sweep line algorithm for voronoi graph computation
voronoi-diagram voronoi voronoi-algorithm voronoi-generator fortune-algorithm sweep-line sweep-line-algorithm
-
Updated
Jul 12, 2023 - Python
Sweep Line algorithm for segments intersection
segment vector computational-geometry intersection computational-geometry-algorithms sweep-line sweep-line-algorithm sweepline
-
Updated
Dec 10, 2021 - Python
Computes and highlights the maximum sum of a list of signed integers
-
Updated
Apr 12, 2024 - JavaScript
2d collision routines
go golang collision-detection golang-package 2d-collision-library sweep-line-algorithm dda-algorithm 2d-collision 2d-collision-checker
-
Updated
Jun 24, 2025 - Go
Computes intersections of multiple horizontal and vertical lines
-
Updated
Apr 14, 2024 - JavaScript
Computes border of unification of multiple rectangles
-
Updated
Apr 13, 2024 - JavaScript
A 2D linear classifier that wraps each group of points in a tight shape and then draws a separating line
-
Updated
Jun 1, 2024 - Jupyter Notebook
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.
triangulation convex-hull geometric-algorithms sweep-line-algorithm segments-intersections geometric-predicates y-monotone-polygons
-
Updated
Jun 23, 2023 - Jupyter Notebook
A sweep line algorithm which finds all the intersection points in a layer of wires.
avl-tree binary-search-tree algorithms-and-data-structures avl-tree-implementations sweep-line-algorithm
-
Updated
Sep 13, 2022 - Python
Implementation of Sweep Line Algorithm on Java
-
Updated
Aug 4, 2023 - Java
Geometric Alghoritms Project of @usi 20/21
-
Updated
Aug 24, 2022 - Python
A B-Tree implementation of sweep line algorithm for segment intersection
-
Updated
Dec 2, 2024 - C++
Computes closest pairs of points
-
Updated
Apr 13, 2024 - JavaScript
Improve this page
Add a description, image, and links to the sweep-line-algorithm topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the sweep-line-algorithm topic, visit your repo's landing page and select "manage topics."