Habrador/Computational-geometry

Health v2 · maintenance only

Flags: no_releases

Adoption not part of the score

1464 stars · 160 forks observed · 2026-08-28

What it is AI-extracted, prompt v1, taxonomy v1, 2026-08-30, confidence not recorded

A C# computational geometry library for Unity implementing intersection algorithms, triangulations (Delaunay, constrained Delaunay), Voronoi diagrams, convex hulls, polygon clipping, Bezier curves, and mesh operations like ear clipping and simplification. It ships with a test folder and a drop-in folder for Unity projects, with algorithms also explained in tutorial form.

Use cases

• generate delaunay triangulation in unity
• compute voronoi diagram c#
• clip polygons in a unity game
• find convex hull of points
• simplify 3d meshes programmatically
• test line and plane intersections
• extrude a mesh along a bezier curve

When to choose

• you're building a Unity game or simulation needing triangulation, hulls, or Voronoi diagrams
• you want readable, tutorial-backed C# implementations of classic geometry algorithms
• you need mesh generation, deformation, or simplification inside Unity

When to avoid

• you need a high-performance, production-hardened geometry kernel outside Unity
• you require robust handling of unnormalized or extreme floating-point coordinates
• you need a maintained general-purpose 2D geometry library for non-game applications

Facets

library · maturity active

graphics simulation math image-processing graphics simulation game-engine cross-platform computational-geometry delaunay-triangulation voronoi-diagram convex-hull polygon-clipping bezier-curves ear-clipping mesh-simplification marching-squares unity3d game-development algorithms c#

Member repositories

For agents

markdown · JSON · MCP: product_card(name="Habrador/Computational-geometry")