Alternatives and similar repositories for numpyeigen:

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

• rgl-epfl / cholespy
  An easily integrable Cholesky solver on CPU and GPU
  ☆232Updated 2 months ago
• nmwsharp / nonmanifold-laplacian
  A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]
  ☆134Updated last year
• sgsellan / gpytoolbox
  A collection of utility functions to prototype geometry processing research in python
  ☆218Updated 2 months ago
• scopatz / pyembree
  Python Wrapper for Embree
  ☆90Updated last year
• qnzhou / PyRenderer
  3D Geometry Renderer for Python
  ☆53Updated 4 years ago
• polyfem / polysolve
  Easy-to-use linear and non-linear solver
  ☆51Updated 2 weeks ago
• patr-schm / TinyAD
  Automatic Differentiation in Geometry Processing Made Simple
  ☆384Updated 3 months ago
• alecjacobson / sparse-solver-benchmark
  ☆39Updated 2 years ago
• skoch9 / meshplot
  Plot 3D triangle meshes
  ☆151Updated 6 months ago
• GeometryCollective / fieldgen
  Generates high-quality, optimally smooth tangent direction fields on triangle meshes.
  ☆165Updated last year
• wangbolun300 / fast-envelope
  This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…
  ☆56Updated last year
• nmwsharp / navigating-intrinsic-triangulations-demo
  Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019
  ☆50Updated 8 months ago
• patr-schm / TinyAD-Examples
  Code examples for automatic differentiation with TinyAD
  ☆28Updated last year
• mbotsch / polyLaplace
  Source code for serveral papers on discrete Laplace operators on general polygons and polyhedral meshes
  ☆33Updated 9 months ago
• wjakob / nanobind_example
  A nanobind example project
  ☆99Updated this week
• nmwsharp / robust-laplacians-py
  Build high-quality Laplace matrices on meshes and point clouds in Python. Implements [Sharp & Crane SGP 2020].
  ☆221Updated 3 months ago
• jiangzhongshi / bichon
  Robust Coarse Curved TetMesh Generation
  ☆35Updated last year
• meshpro / meshplex
  Compute interesting points, areas, and volumes in simplex meshes of any dimension.
  ☆105Updated 8 months ago
• avaxman / libhedra
  A library providing functionality for the geometric processing of polygonal(non-triangular) meshes.
  ☆61Updated 5 months ago
• deshanadesai / acorns
  https://arxiv.org/pdf/2007.05094.pdf An Easy-To-Use Code Generator for Gradients and Hessians
  ☆30Updated 3 years ago
• janba / GEL
  A library of geometry processing tools for computer graphics
  ☆101Updated last week
• wildmeshing / wildmeshing-python
  Python bindings for TriWild.
  ☆47Updated 2 months ago
• ilastik / marching_cubes
  Standalone marching cubes implementation and Python bindings
  ☆98Updated last year
• rubenwiersma / pointcloud-differential
  Gradient, divergence, Laplacian on point clouds. Useful for setting up and solving PDEs on point clouds and learning anisotropic features…
  ☆75Updated 2 years ago
• dpa1mer / arff
  Algebraic Representations for Volumetric Frame Fields
  ☆20Updated 4 years ago
• gishi523 / cusparse-cholesky-solver
  A sample code for sparse cholesky solver with cuSPARSE and cuSOLVER library
  ☆18Updated 5 years ago
• fwilliams / surface-reconstruction-benchmark
  A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al
  ☆52Updated 5 months ago
• ggael / otmap
  c++ optimal transport solver on 2D grids
  ☆53Updated 5 years ago
• rgl-epfl / fastsweep
  Efficient Eikonal equation solver using CUDA
  ☆91Updated 3 weeks ago
• mkazhdan / MoebiusRegistration
  Moebius Registration
  ☆63Updated 5 months ago