Alternatives and similar repositories for recon:

Users that are interested in recon are comparing it to the libraries listed below

• justachetan / DiffGeoOps
  Python implementation of the paper "Discrete Differential-Geometry Operators for Triangulated 2-Manifolds" by Meyer et. al. VisMath 2002
  ☆53Updated last year
• avaxman / DirectionalFieldSynthesis
  Directional Field Synthesis, Design, and Processing
  ☆82Updated 3 years ago
• a-nasikun / FastSpectrum
  We approximate the lowest part of the eigenvalues and eigenfunctions of Laplace-Beltrami operator, to have faster speed, less storage, an…
  ☆24Updated 5 years ago
• Roipo / CompMajor
  An implementation of "Geometric optimization via composite majorization" [Shtengel et al. 2017]
  ☆16Updated 2 weeks ago
• mrgt / MongeAmpere
  Solve large instance of semi-discrete optimal transport problems and other Monge-Ampere equations
  ☆28Updated 4 years ago
• nmwsharp / navigating-intrinsic-triangulations-demo
  Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019
  ☆51Updated 10 months ago
• nbonneel / spot
  SPOT: Sliced Partial Optimal Transport
  ☆61Updated 5 years ago
• cfwen / geometry-processing-package
  Geometry Processing Package
  ☆53Updated last year
• gpeyre / 2015-SIGGRAPH-convolutional-ot
  J. Solomon, F. de Goes, G. Peyré, M. Cuturi, A. Butscher, A. Nguyen, T. Du, L. Guibas. Convolutional Wasserstein Distances: Efficient Opt…
  ☆104Updated 7 years ago
• ggael / otmap
  c++ optimal transport solver on 2D grids
  ☆56Updated 5 years ago
• odedstein / ASmoothnessEnergyWithoutBoundaryDistortionForCurvedSurfaces
  A Smoothness Energy without Boundary Distortion for Curved Surfaces - code
  ☆22Updated 3 years ago
• michaelbalzer / ccvt
  Capacity-Constrained Voronoi Tessellations
  ☆21Updated 9 years ago
• fwilliams / numpyeigen
  Fast zero-overhead bindings between NumPy and Eigen
  ☆139Updated last month
• larc / gproshan
  geometry processing and shape analysis framework
  ☆67Updated last month
• ashwin / gStar4D
  Computes the 3D Delaunay triangulation on the GPU
  ☆127Updated 3 years ago
• wildmeshing / wildmeshing-python
  Python bindings for TriWild.
  ☆52Updated 4 months ago
• ingowald / closestSurfacePointQueries
  Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point
  ☆24Updated 3 years ago
• cgogn / CGoGN_3
  n-dimensional Meshes with Combinatorial Maps
  ☆37Updated last month
• danielepanozzo / gp-old
  ☆67Updated 6 years ago
• odedstein / gp-matlab-tutorial
  A basic tutorial for geometry processing in MATLAB using gptoolbox
  ☆46Updated last year
• wangbolun300 / fast-envelope
  This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…
  ☆57Updated last month
• nmwsharp / DDGSpring2016
  Code repository for 15-869 Discrete Differential Geometry at CMU in Spring 2016.
  ☆120Updated 8 years ago
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆152Updated 6 years ago
• geometryprocessing / ConformalIdealDelaunay
  ☆16Updated last year
• nmwsharp / flip-geodesics-demo
  Construct geodesic paths, loops, networks on surface with a fast and simple edge flipping algorithm. C++ demo app and more.
  ☆100Updated last year
• ilastik / marching_cubes
  Standalone marching cubes implementation and Python bindings
  ☆99Updated last year
• duxingyi-charles / lifting_simplices_to_find_injectivity
  injective mapping via TLC (total lifted content) energy minimization (SIGGRAPH 2020)
  ☆18Updated 4 years ago
• mkazhdan / IsoSurfaceExtraction
  Isosurface extraction from regular voxel grids
  ☆78Updated 7 years ago
• libigl / libigl-tutorial-data
  Data for libigl tutorial
  ☆34Updated 4 years ago
• polyfem / polysolve
  Easy-to-use linear and non-linear solver
  ☆51Updated 2 weeks ago