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)

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.

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.

Android app that generates convex hulls using computational geometry algorithms

A library with several computational geometry algorithms in the N-dimensional space.

A Computational Geometry course repository including some experiments

bunch of scripts useful for building geospatial softwares

Computational Geometry Assignments for CS F402 at BPHC 2020-2021 session Semester 1.

📐 Geometry Uni Assignments

2D computational geometry library