Alternatives and similar repositories for numpyeigen:

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

• scopatz / pyembree
  Python Wrapper for Embree
  ☆90Updated last year
• rgl-epfl / cholespy
  An easily integrable Cholesky solver on CPU and GPU
  ☆233Updated 3 months ago
• skoch9 / meshplot
  Plot 3D triangle meshes
  ☆151Updated 7 months ago
• wildmeshing / wildmeshing-python
  Python bindings for TriWild.
  ☆47Updated 2 months ago
• nmwsharp / nonmanifold-laplacian
  A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]
  ☆135Updated last year
• sgsellan / gpytoolbox
  A collection of utility functions to prototype geometry processing research in python
  ☆224Updated 3 months ago
• patr-schm / TinyAD
  Automatic Differentiation in Geometry Processing Made Simple
  ☆385Updated 4 months ago
• qnzhou / PyRenderer
  3D Geometry Renderer for Python
  ☆54Updated 4 years ago
• nmwsharp / navigating-intrinsic-triangulations-demo
  Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019
  ☆49Updated 8 months ago
• polyfem / polysolve
  Easy-to-use linear and non-linear solver
  ☆51Updated last month
• GeometryCollective / fieldgen
  Generates high-quality, optimally smooth tangent direction fields on triangle meshes.
  ☆166Updated last year
• nmwsharp / polyscope-py
  Python bindings for Polyscope
  ☆39Updated last month
• sampotter / python-embree
  ☆21Updated 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
• BrunoLevy / pygeogram
  Python bindings for geogram
  ☆18Updated 4 months ago
• larc / gproshan
  geometry processing and shape analysis framework
  ☆66Updated 3 months ago
• nmwsharp / robust-laplacians-py
  Build high-quality Laplace matrices on meshes and point clouds in Python. Implements [Sharp & Crane SGP 2020].
  ☆222Updated 3 months ago
• alecjacobson / sparse-solver-benchmark
  ☆39Updated 3 years ago
• fwilliams / surface-reconstruction-benchmark
  A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al
  ☆52Updated 6 months ago
• avaxman / libhedra
  A library providing functionality for the geometric processing of polygonal(non-triangular) meshes.
  ☆61Updated 2 weeks ago
• patr-schm / TinyAD-Examples
  Code examples for automatic differentiation with TinyAD
  ☆28Updated last year
• ozen / PyOptiX
  Python wrapper for NVIDIA OptiX Ray Tracing Engine
  ☆66Updated 6 years ago
• davidstutz / mesh-evaluation
  Efficient C++ implementation of mesh-to-mesh and mesh-to-point distance.
  ☆59Updated 6 years ago
• nmwsharp / intrinsic-triangulations-tutorial
  An introductory course intrinsic triangulations for powerful & robust geometry processing --- tutorial code and links.
  ☆128Updated 2 years ago
• scikit-sparse / scikit-sparse
  Sparse matrix tools extending scipy.sparse, but with incompatible licenses
  ☆164Updated 4 months ago
• ilastik / marching_cubes
  Standalone marching cubes implementation and Python bindings
  ☆99Updated last year
• chadogome / OptimalOBB
  Optimal Oriented Bounding Boxes algorithms
  ☆46Updated 6 years ago
• EPFL-LGG / RotationOptimization
  Gradients/Hessians for optimizing with rotation variables.
  ☆26Updated 2 years ago
• rgl-epfl / fastsweep
  Efficient Eikonal equation solver using CUDA
  ☆91Updated last month
• GavinBarill / fast-winding-number-soups
  An example that complies and runs the fast winding number for soups
  ☆71Updated 6 years ago