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.

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

Label geographic regions by finding largest empty rectangles inside general polygons

A Python package for computational geometry.

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

🎨Coding Project 2 for Computational Geometry Course (CSN-523)

📐 Computational geometry labs

Sweep Line algorithm for segments intersection

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

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.

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.

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