Alternatives and similar repositories for efficient-marching-cubes

Users that are interested in efficient-marching-cubes are comparing it to the libraries listed below

• Magnus2 / MeshSdf
  Signed Distance Function from triangle mesh.
  ☆95Updated 6 years ago
• avaxman / libhedra
  A library providing functionality for the geometric processing of polygonal(non-triangular) meshes.
  ☆61Updated 11 months ago
• alecjacobson / sparse-solver-benchmark
  ☆39Updated 3 years ago
• huxingyi / isotropicremesher
  Isotropic Remeshing of Triangulated Surface
  ☆93Updated 3 years ago
• planaria / dmc
  Dual Marching Cubes Implementation in C++
  ☆65Updated 5 years ago
• GavinBarill / fast-winding-number-soups
  An example that complies and runs the fast winding number for soups
  ☆82Updated 7 years ago
• cg3hci / cg3lib
  A C++ geometry processing library
  ☆52Updated 4 years ago
• wangbolun300 / fast-envelope
  This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…
  ☆61Updated 7 months ago
• MarcoAttene / VolumeMesher
  Convex Polyhedral Meshing for Robust Solid Modeling
  ☆61Updated last month
• larc / gproshan
  geometry processing and shape analysis framework
  ☆69Updated 10 months ago
• alecjacobson / libigl-tinyad-example
  ☆22Updated last year
• tysonbrochu / eltopo
  ☆130Updated 8 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 4 years ago
• mkazhdan / TextureSignalProcessing
  Gradient-Domain Processing within a Texture Atlas
  ☆75Updated 4 months ago
• jiangzhongshi / Scaffold-Map
  Robust, efficient and low distortion bijective mapping in 2D and 3D
  ☆61Updated 4 years ago
• mkazhdan / IsoSurfaceExtraction
  Isosurface extraction from regular voxel grids
  ☆81Updated 8 years ago
• Philip-Trettner / probabilistic-quadrics
  Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"
  ☆58Updated last year
• alecjacobson / FAST
  Fast Automatic Skinning Transformations
  ☆69Updated 7 years ago
• GeometryCollective / fieldgen
  Generates high-quality, optimally smooth tangent direction fields on triangle meshes.
  ☆176Updated 2 years ago
• nmwsharp / navigating-intrinsic-triangulations-demo
  Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019
  ☆51Updated last year
• unclearness / ugu
  UGU: Unclearness Geometry Utility
  ☆40Updated last month
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆176Updated 7 years ago
• nmwsharp / flip-geodesics-demo
  Construct geodesic paths, loops, networks on surface with a fast and simple edge flipping algorithm. C++ demo app and more.
  ☆108Updated 2 years ago
• avaxman / MoebiusCode
  Demo for the SIGGRAPH 2015 paper: "Conformal Mesh Deformations with Möbius Transformations".
  ☆24Updated 11 months ago
• nmwsharp / vector-heat-demo
  C++ demo of the Vector Heat Method & Affine Heat Method. Interpolate scalars and vectors on surfaces, compute log maps, and more.
  ☆66Updated 7 months ago
• mkazhdan / ShapeGradientDomain
  Gradient domain processing for signals (and geometry) on meshes
  ☆36Updated 7 months ago
• Ahdhn / MeshImp
  A Constrained Resampling Strategy for Mesh Improvement - SGP 2017
  ☆59Updated 4 years ago
• ialhashim / topo-blend
  3D topology blending tool
  ☆26Updated 10 years ago
• unclejimbo / Euclid
  C++ Shape Analysis and Geometry Processing
  ☆40Updated last year
• sylefeb / VoxSurf
  A simple, easily hackable C++ surface voxelizer (STL=>voxels)
  ☆180Updated 4 years ago