Computational geometry algorithms for n-space. Repairing self-intersecting shapes, computing convex hull(regular and minimal/maximum rectilinear), etc.
owenhappy / geo Goto Github PK
View Code? Open in Web Editor NEWThis project forked from neetaaeapen/geo
Computational geometry algorithms for polygons. Repairing self-intersecting polygons using constrained triangulation, computing convex hull(regular and minimal/maximum rectilinear), etc.
License: MIT License