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
Pure Python implementation of a sweep line algorithm for line-segment intersections, based on a paper by Mehlhorn and Näher.
This repository contains my own computational geometry Python package: geometric. It covers fundamental algorithms and data structures, with a focus on practical applications.
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."