Related categories 2
Sites 15
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.
J-D. Boissonnat et al.'s code for Delaunay meshing in 2 and 3 dimensions in C++.
By Martin Held. Copes with polygons with holes and degeneracies/self-intersections; based on repeatedly clipping ears. Source code on request.
C code for orientation and incircle tests using adaptive-precision floating-point arithmetic
FastGEO, A computational geometry library written in the object pascal language.
Gmsh is a three-dimensional finite element mesh generator, primarily Delaunay, with built-in pre- and post-processing facilities. Gmsh is freely available for Windows and most UNIX platforms.
Open-source library for manipulating 3D triangular surface meshes. Delaunay triangulations, robust geometric predicates, robust boolean set operations on surfaces, surface refinement and coarsening, level-of-detail, k-d trees, volume and curvature, strips generation.
Two Java applets for editing polygons and point sets for input to computational geometry software.
Produces commercial software that creates a surface model out of a pointcloud or polymesh [Balingen, Germany].
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.
Mesh generation in 2D and 3D on Unix and NT, and related software by Steven Vavasis.
Fast and robust C++ code available under GNU license. Handles arbitrary dimensions, and has high numerical stability.
Summary of major CG problems and implementations of their solutions
Jonathan Richard Shewchuk's Two-Dimensional Quality Mesh Generator and Delaunay Triangulator.
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.
C code for orientation and incircle tests using adaptive-precision floating-point arithmetic
Jonathan Richard Shewchuk's Two-Dimensional Quality Mesh Generator and Delaunay Triangulator.
Gmsh is a three-dimensional finite element mesh generator, primarily Delaunay, with built-in pre- and post-processing facilities. Gmsh is freely available for Windows and most UNIX platforms.
By Martin Held. Copes with polygons with holes and degeneracies/self-intersections; based on repeatedly clipping ears. Source code on request.
A collaborative effort to develop a robust, easy to use, and efficient C++ software library of geometric data structures and algorithms.
J-D. Boissonnat et al.'s code for Delaunay meshing in 2 and 3 dimensions in C++.
Produces commercial software that creates a surface model out of a pointcloud or polymesh [Balingen, Germany].
FastGEO, A computational geometry library written in the object pascal language.
Open-source library for manipulating 3D triangular surface meshes. Delaunay triangulations, robust geometric predicates, robust boolean set operations on surfaces, surface refinement and coarsening, level-of-detail, k-d trees, volume and curvature, strips generation.
Mesh generation in 2D and 3D on Unix and NT, and related software by Steven Vavasis.
Lot of categories and links.
Fast and robust C++ code available under GNU license. Handles arbitrary dimensions, and has high numerical stability.
Two Java applets for editing polygons and point sets for input to computational geometry software.
Summary of major CG problems and implementations of their solutions
