Geometric Algorithms implemented for Java Processing v3

Pure Python implementation of a sweep line algorithm for line-segment intersections, based on a paper by Mehlhorn and Näher.

Java implementation of Bentley-Ottmann segments intersection finding algorithm

Implements the Balaban algorithm for finding intersecting segment pairs from a set of line segments.

Simple two segment intersection

This repository contains my own computational geometry Python package: geometric. It covers fundamental algorithms and data structures, with a focus on practical applications.

2D computational geometry

A B-Tree implementation of sweep line algorithm for segment intersection