gnardari / wasserstein
Header only C++ implementation of the Wasserstein distance (or earth mover's distance)
☆13Updated 4 years ago
Alternatives and similar repositories for wasserstein:
Users that are interested in wasserstein are comparing it to the libraries listed below
- ☆39Updated last year
- Reconstruction of triangulated surfaces from range-scanned point clouds☆36Updated 6 years ago
- This is repository for CMPT 764 course project☆12Updated 7 years ago
- A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al☆52Updated 5 months ago
- ☆25Updated 3 weeks ago
- This is a C++11 friendly mirror of GraphCuts. It generates no warnings when compiled on MacOS with clang☆14Updated 6 years ago
- A Benchmark for Surface Reconstruction☆12Updated 9 years ago
- Surface Reconstruction☆28Updated 5 years ago
- Fork of https://sourceforge.net/projects/imatistl/☆16Updated 6 years ago
- Efficient C++ implementation of mesh-to-mesh and mesh-to-point distance.☆59Updated 6 years ago
- A simple benchmark comparing various libraries for ply file i/o☆25Updated 2 months ago
- ☆19Updated 4 years ago
- 2d medial axis transform using tracing paths [Joan-Arinyo et al.]☆32Updated 5 years ago
- Mepp2 - 3D MEsh Processing Platform☆76Updated 2 years ago
- ☆32Updated 5 years ago
- A C++ implementation of polyharmonic/thin-plate spline transformation/interpolation☆23Updated 7 years ago
- A fast surface reconstruction method from Hermite points☆33Updated 8 years ago
- Progressive 3D Modeling All the Way☆23Updated 8 years ago
- Offers several algorithms to triangulate 3d scattered points☆46Updated 4 years ago
- A library providing functionality for the geometric processing of polygonal(non-triangular) meshes.☆61Updated 6 months ago
- A projection-based bijective map definition and a robust algorithm to construct the prismatic shell domain. https://cs.nyu.edu/~zhongshi/…☆27Updated 3 years ago
- C++ Shape Analysis and Geometry Processing☆38Updated 9 months ago
- ☆9Updated 6 years ago
- Implicit Hierarchical B-Splines Surface Reconstruction based on Octree Distance Field☆29Updated 7 years ago
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆148Updated 6 years ago
- EMVS (Efficient Large Scale Multi-View Stereo for Ultra High Resolution Image Sets)☆24Updated last year
- Implementation of Hash table for Nießner's Voxel Hashing method☆14Updated 9 years ago
- Public code release for "Swept Volumes via Spacetime Numerical Continuation", presented at SIGGRAPH 2021 and authored by Silvia Sellán, N…☆55Updated 7 months ago
- A sample code for sparse cholesky solver with cuSPARSE and cuSOLVER library☆18Updated 5 years ago
- Implemented large scale 3d mesh generation in parallel using CUDA.☆13Updated 5 years ago