Lot of categories and links.
A collaborative effort to develop a robust, easy to use, and efficient C++ software library of geometric data structures and algorithms.
A simple C++ R-tree implementation with Segment Incidences Detector as an application.
Computes convex hulls, Delaunay triangulations, Voronoi diagrams, half-space intersections about a point, furthest-site Delaunay triangulations, and furthest-site Voronoi diagrams. It runs in 2-d, 3-d, 4-d, and higher dimensions.
Links to Surface Reconstruction software, papers, people.
FastGEO, A computational geometry library written in the object pascal language.
Frequently Asked Questions in Polyhedral Computation.
Science /
Math /
Geometry /
Software
|