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
  ☆94Updated 2 years ago
• rgl-epfl / cholespy
  An easily integrable Cholesky solver on CPU and GPU
  ☆242Updated 10 months ago
• skoch9 / meshplot
  Plot 3D triangle meshes
  ☆151Updated last year
• sgsellan / gpytoolbox
  A collection of utility functions to prototype geometry processing research in python
  ☆249Updated 2 weeks ago
• nmwsharp / nonmanifold-laplacian
  A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]
  ☆140Updated last year
• qnzhou / PyRenderer
  3D Geometry Renderer for Python
  ☆54Updated 5 years ago
• wildmeshing / wildmeshing-python
  Python bindings for TriWild.
  ☆53Updated 9 months ago
• patr-schm / TinyAD
  Automatic Differentiation in Geometry Processing Made Simple
  ☆409Updated 5 months ago
• alecjacobson / gp-cli
  Command Line Tools for Geometry Processing
  ☆42Updated last year
• 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
• janba / GEL
  A library of geometry processing tools for computer graphics
  ☆109Updated last week
• avaxman / libhedra
  A library providing functionality for the geometric processing of polygonal(non-triangular) meshes.
  ☆61Updated 7 months ago
• nmwsharp / robust-laplacians-py
  Build high-quality Laplace matrices on meshes and point clouds in Python. Implements [Sharp & Crane SGP 2020].
  ☆245Updated 10 months ago
• nmwsharp / navigating-intrinsic-triangulations-demo
  Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019
  ☆51Updated last year
• alecjacobson / sparse-solver-benchmark
  ☆39Updated 3 years ago
• sampotter / python-embree
  ☆21Updated last year
• larc / gproshan
  geometry processing and shape analysis framework
  ☆68Updated 6 months ago
• davidstutz / mesh-evaluation
  Efficient C++ implementation of mesh-to-mesh and mesh-to-point distance.
  ☆60Updated 6 years ago
• nmwsharp / polyscope-py
  Python bindings for Polyscope
  ☆49Updated last month
• PhHerholz / SymbolicLib
  ☆23Updated 2 years ago
• GeometryCollective / fieldgen
  Generates high-quality, optimally smooth tangent direction fields on triangle meshes.
  ☆174Updated 2 years ago
• EPFL-LGG / RotationOptimization
  Gradients/Hessians for optimizing with rotation variables.
  ☆26Updated 2 years ago
• chadogome / OptimalOBB
  Optimal Oriented Bounding Boxes algorithms
  ☆48Updated 6 years ago
• hankstag / progressive_embedding
  Implementation of SIGGRAPH 2019 paper: Progressive Embedding
  ☆36Updated 4 years ago
• fwilliams / surface-reconstruction-benchmark
  A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al
  ☆53Updated last year
• alecjacobson / geometry-processing-curvature
  Curvature assignment for Geometry Processing course
  ☆156Updated 2 years ago
• jiangzhongshi / bichon
  Robust Coarse Curved TetMesh Generation
  ☆38Updated last year
• polyfem / polysolve
  Easy-to-use linear and non-linear solver
  ☆54Updated 3 months ago
• patr-schm / TinyAD-Examples
  Code examples for automatic differentiation with TinyAD
  ☆29Updated 5 months ago
• danielepanozzo / gp-old
  ☆67Updated 6 years ago