Points, Lines, Boxes, Polygons (also hollow), Ellipses, Circles. RayCasting, offsets, rotation, scaling, bounding box padding, flags for static and ghost/trigger bodies
Team reference for Competitive Programming. Algorithms implementations very used in the ACM-ICPC contests. Latex template to build your own team reference.
A Python package for computational geometry.
Concave Hull library based on JTS, supporting mulitple criteria, multi-part hull and hull with holes
Label geographic regions by finding largest empty rectangles inside general polygons
Implementation of algorithms for hotspot computation on trajectory data
Демо приложение на streamlit созданное в образовательных целях
Minkowski sum/difference computation, built on top of JTS
Reconstruction of an Eulerian indicator/marker-function field from Lagrangian front using a fast-Poisson solver
A blazingly fast, production-ready Go implementation of the Bentley-Ottmann algorithm for counting line segment intersections.
Демо приложение на streamlit + FastAPI созданное в образовательных целях
🎨Coding Project 2 for Computational Geometry Course (CSN-523)
📐 Computational geometry labs
Sweep Line algorithm for segments intersection
A small and lightweight library to store and work with 2-, 3- and 4-dimensional vectors
My own implementation of classical computational geometry algorithms on diverse languages.
Polygon Boolean Operations Visualizer is a cross-platform C++ app for interactively visualizing Boolean operations (union, intersection, difference, symmetric difference) on 2D polygons. Built with CGAL and Qt, it’s ideal for anyone needing clear, accurate polygon set operation demos.
Android app that generates convex hulls using computational geometry algorithms
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."