Java implementation of Bentley-Ottmann segments intersection finding algorithm
-
Updated
Dec 14, 2021 - Java
Java implementation of Bentley-Ottmann segments intersection finding algorithm
Implements the Balaban algorithm for finding intersecting segment pairs from a set of line segments.
Add a description, image, and links to the segment-intersection topic page so that developers can more easily learn about it.
To associate your repository with the segment-intersection topic, visit your repo's landing page and select "manage topics."