There are 3 repositories under computational-geometry-algorithms topic.
detecting collisions between bodies: Points, Lines, Boxes, Polygons (Concave too), Ellipses and Circles. Also RayCasting. All bodies can have offset, rotation, scale, bounding box padding, can be static (non moving) or be trigger bodies (non colliding).
Team reference for Competitive Programming. Algorithms implementations very used in the ACM-ICPC contests. Latex template to build your own team reference.
Concave Hull library based on JTS, supporting mulitple criteria, multi-part hull and hull with holes
Implementation of algorithms for hotspot computation on trajectory data
📐 Computational geometry labs
Minkowski sum/difference computation, built on top of JTS
🎨Coding Project 2 for Computational Geometry Course (CSN-523)
My own implementation of classical computational geometry algorithms on diverse languages.
A small and lightweight library to store and work with 2-, 3- and 4-dimensional vectors
A library with several computational geometry algorithms in the N-dimensional space.
Android app that generates convex hulls using computational geometry algorithms
The implementation in C++ of the closest-pair doubling algorithm which finds the smallest distance between two points in a metric space in O(n log n) time without directly using the points' coordinates.
Computational Geometry Assignments for CS F402 at BPHC 2020-2021 session Semester 1.
A Computational Geometry course repository including some experiments
Advanced algorithms course (SCC0218). Solutions for competitive programming problems(CSES Problem Set).
Convex Hull Algorithms (2D & 3D), KD-Trees, Orthogonal Search, Delaunay Triangulation
📐 Geometry Uni Assignments
computational geometry exercises
Convex Hull with Jarvis' Algorithm implemented in Julia