thinks / fast-marching-methodLinks
Single file, header-only, no dependencies C++ implementation of the fast marching method in arbitrary dimensions.
☆155Updated 2 years ago
Alternatives and similar repositories for fast-marching-method
Users that are interested in fast-marching-method are comparing it to the libraries listed below
Sorting:
- Isosurface extraction from regular voxel grids☆81Updated 8 years ago
- N-Dimensional Fast Methods: Fast Marching, Fast Sweeping, Group Marching, Fast Iterative, etc.☆178Updated 2 years ago
- This is a clone of "A Quality Tetrahedral Mesh Generator and a 3D Delaunay Triangulator" tetgen; Official website:☆205Updated 9 months ago
- This is a mirror of the latest stable version of Tetgen.☆105Updated 6 months ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆84Updated 2 years ago
- C++ Shape Analysis and Geometry Processing☆40Updated last year
- Computes the 3D Delaunay triangulation on the GPU☆132Updated 4 years ago
- Construct geodesic paths, loops, networks on surface with a fast and simple edge flipping algorithm. C++ demo app and more.☆107Updated 2 years ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆61Updated 4 months ago
- The Robust Quad Mesh Extraction Library☆125Updated 5 years ago
- Contact model for 3D elastic rod simulations. Framework for knot tying.☆19Updated last year
- Single file, header-only, no-dependencies C library for Poisson disk sampling in arbitrary dimensions.☆120Updated 9 months ago
- A static C++ library for the generation of discrete functions on a box-shaped domain. This is especially suited for the discretization of…☆308Updated 2 years ago
- Variational Polygonal/Polyhedral Shape Functions☆15Updated 3 years ago
- Scattered data interpolation with multilevel B-Splines☆79Updated last year
- Fast and light-weight Marching Cubes library in C++ without any dependencies.☆179Updated 7 years ago
- Directional Field Synthesis, Design, and Processing☆85Updated 4 years ago
- Signed Distance Function from triangle mesh.☆94Updated 6 years ago
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆173Updated 7 years ago
- Curvature assignment for Geometry Processing course☆156Updated 2 years ago
- This is the header-only version of the code we used for the experiments in the paper "Fast and Robust Mesh Arrangements using Floating-po…☆165Updated last year
- Cut a tetrahedral mesh with a triangle mesh in 3D.☆87Updated 4 years ago
- Least squares conformal mapping implemented in C++☆115Updated 5 years ago
- Source code for paper "Parallel Computation of 3D Clipped Voronoi Diagrams"☆31Updated 5 years ago
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆176Updated last year
- A short, reasonnably simple, fast, and robust function to determine if a set of points are inside a 3d mesh☆77Updated 6 years ago
- Git mirror of the geogram library by INRIA☆131Updated 3 years ago
- Quadrilateral-dominant and Hexahedral-dominant meshes generator☆92Updated 7 months ago
- Fast Marching Method and Geodesic In Heat Method☆32Updated 5 years ago
- FastCorotatedFEM is a minimalistic implementation of the corotated FEM method which was proposed in paper "Fast Corotated FEM using Opera…☆77Updated 6 years ago