A Python package for computational geometry.
Sweep Line algorithm for segments intersection
A repository containing my implementations of various computational geometry algorithms, including Convex Hull and Delaunay Triangulation, all written in Go. It provides a Benchmark for further testing.
bunch of scripts useful for building geospatial softwares
The visualization elegantly demonstrates how Euclidean geometry focuses on distances and angles, while Affine geometry preserves parallelism and ratios but not necessarily distances or angles. The interactive nature lets you explore these concepts hands-on!
Add a description, image, and links to the computational-geometry-algorithms topic page so that developers can more easily learn about it.
To associate your repository with the computational-geometry-algorithms topic, visit your repo's landing page and select "manage topics."