Alternatives and similar repositories for MarchingTetrahedra

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

• cheind / sdftoolbox
  Vectorized Python methods for creating, manipulating and tessellating signed distance fields.
  ☆56Updated 2 years ago
• weshoke / efficient-marching-cubes
  Implementation of Efficient implementation of Marching Cubes’ cases with topological guarantees
  ☆35Updated 4 years ago
• MarkGillespie / intrinsic-triangulations-demo
  Guaranteed-robust intrinsic triangulations for surface mesh processing! (C++ demo app)
  ☆32Updated 2 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
• MarkGillespie / CEPS
  Discrete Conformal Equivalence of Polyhedral Surfaces
  ☆109Updated 2 years ago
• planaria / dmc
  Dual Marching Cubes Implementation in C++
  ☆65Updated 5 years ago
• vilya / miniply
  A fast and easy-to-use PLY parsing library in a single c++11 header and cpp file
  ☆85Updated 2 years 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 6 months ago
• drufat / triangle-c
  ☆11Updated 5 years ago
• larc / gproshan
  geometry processing and shape analysis framework
  ☆68Updated 9 months ago
• dominikwodniok / dualmc
  Simple C++ implementation of the (manifold) dual marching cubes algorithm from Gregory M. Nielson
  ☆182Updated 6 years ago
• tatsy / tinymesh
  TinyMesh is a light-weight mesh processing library in C/C++.
  ☆99Updated 2 years ago
• nmwsharp / nonmanifold-laplacian
  A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]
  ☆147Updated last year
• alicevision / geogram
  Git mirror of the geogram library by INRIA
  ☆131Updated 3 years ago
• BrunoLevy / GraphiteThree
  Experimental 3D modeler
  ☆277Updated this week
• rogrosso / tmc
  ☆35Updated last year
• cnr-isti-vclab / corto
  Mesh compression library, designed for rendering and speed.
  ☆208Updated 3 weeks ago
• nmwsharp / variational-surface-cutting
  Codebase for "Variational Surface Cutting" by Sharp & Crane, SIGGRAPH 2018
  ☆106Updated 4 years ago
• Twinklebear / webgpu-bcmc
  WebGPU Data-Parallel Block-Compressed Marching Cubes Isosurface Extraction
  ☆60Updated 2 years ago
• sylefeb / VoxSurf
  A simple, easily hackable C++ surface voxelizer (STL=>voxels)
  ☆180Updated 4 years ago
• alecjacobson / computer-graphics-meshes
  Computer Graphics Assignment about Meshes
  ☆27Updated 6 years ago
• danshapero / predicates
  Robust geometric predicates
  ☆63Updated last year
• huxingyi / isotropicremesher
  Isotropic Remeshing of Triangulated Surface
  ☆93Updated 3 years ago
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆174Updated 7 years ago
• chrismile / LineVis
  LineVis is a visualization tool for rendering dense sets of 3D lines.
  ☆97Updated last week
• Magnus2 / MeshReconstruction
  Fast and light-weight Marching Cubes library in C++ without any dependencies.
  ☆179Updated 8 years ago
• Twinklebear / webgpu-prog-iso
  Code for the paper "Speculative Progressive Raycasting for Memory Constrained Isosurface Visualization of Massive Volumes"
  ☆19Updated last year
• nmwsharp / navigating-intrinsic-triangulations-demo
  Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019
  ☆51Updated last year
• ashwin / gStar4D
  Computes the 3D Delaunay triangulation on the GPU
  ☆133Updated 4 years ago
• janba / DSC
  Deformable Simplicial Complex (DSC) method
  ☆23Updated 7 years ago