Alternatives and similar repositories for TinyAD

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

• rohan-sawhney / fcpw
  fast distance and ray intersection queries
  ☆427Updated last week
• rohan-sawhney / zombie
  Grid-Free Monte Carlo Solvers for Partial Differential Equations
  ☆253Updated 2 weeks ago
• avaxman / Directional
  A library for Directional Field Synthesis, Design, and Processing.
  ☆205Updated this week
• gcherchi / FastAndRobustMeshArrangements
  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…
  ☆164Updated last year
• owensgroup / RXMesh
  GPU-accelerated triangle mesh processing
  ☆274Updated 2 weeks ago
• GeometryCollective / fieldgen
  Generates high-quality, optimally smooth tangent direction fields on triangle meshes.
  ☆174Updated 2 years ago
• nmwsharp / nonmanifold-laplacian
  A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]
  ☆140Updated last year
• odedstein / meshes
  A repository with a variety of meshes with minimal licensing requirements.
  ☆238Updated last year
• wildmeshing / wildmeshing-toolkit
  Toolkit for Meshing in the Wild
  ☆162Updated last week
• adobe / lagrange
  A Robust Geometry Processing Library
  ☆284Updated this week
• GeometryCollective / ddg-exercises
  Assignment skeleton for course on Discrete Differential Geometry (15-458/858)
  ☆220Updated last year
• sgsellan / gpytoolbox
  A collection of utility functions to prototype geometry processing research in python
  ☆249Updated last week
• MarcoAttene / CDT
  ☆71Updated last month
• nmwsharp / intrinsic-triangulations-tutorial
  An introductory course intrinsic triangulations for powerful & robust geometry processing --- tutorial code and links.
  ☆137Updated 3 years ago
• tysonbrochu / eltopo
  ☆128Updated 4 months ago
• Yixin-Hu / TetWild
  Robust Tetrahedral Meshing in the Wild.
  ☆671Updated 2 years ago
• Continuous-Collision-Detection / Tight-Inclusion
  A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]
  ☆145Updated 4 months ago
• gcherchi / InteractiveAndRobustMeshBooleans
  ☆220Updated 3 months ago
• MarkGillespie / CEPS
  Discrete Conformal Equivalence of Polyhedral Surfaces
  ☆105Updated 2 years ago
• wildmeshing / fTetWild
  Fast Tetrahedral Meshing in the Wild
  ☆496Updated 5 months ago
• ipc-sim / ipc-toolkit
  A set of reusable functions to integrate IPC into an existing simulation.
  ☆263Updated 3 weeks ago
• mitsuba-renderer / drjit-core
  Dr.Jit — A Just-In-Time-Compiler for Differentiable Rendering (core library)
  ☆116Updated last week
• Philip-Trettner / probabilistic-quadrics
  Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"
  ☆56Updated last year
• wildmeshing / TriWild
  TriWild: Robust Triangulation with Curve Constraints
  ☆248Updated 2 years ago
• libigl / libigl-example-project
  A blank project example showing how to use libigl and cmake.
  ☆156Updated last month
• wangbolun300 / fast-envelope
  This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…
  ☆57Updated 3 months ago
• valette / ACVD
  Fast simplification of 3D surface meshes
  ☆347Updated last week
• GeometryCollective / wost-simple
  Simple didactic code + tutorial for the Walk on Stars (WoSt) algorithm
  ☆96Updated 2 years ago
• libigl / tetgen
  This is a mirror of the latest stable version of Tetgen.
  ☆104Updated 5 months ago
• zishun / awesome-geometry-processing
  ☆161Updated last year