In this distribution are standard C and Java language routines for simple computational geometric methods (determining whether a point lies inside a polygon, for instance) as well as robust implementations of complex computational geometry algorithms. Addressed are problems in motion planning, nearest neighbor determination (through the use of Delaunay triangulations and Voronoi diagrams), polygon intersection, convex hull computation, and polygon triangulation.
Convex Hull (8) |
Robust Geometric Primitives (8) |
Intersection Detection (5) |
Nearest Neighbor Search (4) |
Motion Planning (3) |
Point Location (3) |
Voronoi Diagrams (3) |
Triangulation (2) |