#Geometry Algorithms

This module contains computational geometry packages, including convex hull, closest pair, line segment intersection, point-in-polygon, polygon triangulation, half-plane intersection, rotating calipers, and line sweep.

Packages are organized as one algorithm per directory. Each package contains a README.mbt.md tutorial with examples that are checked by moon test.

Run from the workspace root:

moon check
moon test
moon info
moon fmt

Site source Report issue Packages Build queue Skills Statistics