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
  ☆92Updated last year
• rgl-epfl / cholespy
  An easily integrable Cholesky solver on CPU and GPU
  ☆235Updated 6 months ago
• qnzhou / PyRenderer
  3D Geometry Renderer for Python
  ☆54Updated 5 years ago
• skoch9 / meshplot
  Plot 3D triangle meshes
  ☆152Updated 10 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
• ilastik / marching_cubes
  Standalone marching cubes implementation and Python bindings
  ☆99Updated last year
• sgsellan / gpytoolbox
  A collection of utility functions to prototype geometry processing research in python
  ☆233Updated last week
• avaxman / libhedra
  A library providing functionality for the geometric processing of polygonal(non-triangular) meshes.
  ☆61Updated 3 months ago
• nmwsharp / variational-surface-cutting
  Codebase for "Variational Surface Cutting" by Sharp & Crane, SIGGRAPH 2018
  ☆102Updated 4 years ago
• wangbolun300 / fast-envelope
  This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…
  ☆57Updated last month
• sampotter / python-embree
  ☆21Updated last year
• nmwsharp / robust-laplacians-py
  Build high-quality Laplace matrices on meshes and point clouds in Python. Implements [Sharp & Crane SGP 2020].
  ☆230Updated 6 months ago
• nmwsharp / navigating-intrinsic-triangulations-demo
  Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019
  ☆51Updated 11 months ago
• wildmeshing / wildmeshing-python
  Python bindings for TriWild.
  ☆52Updated 5 months ago
• polyfem / polysolve
  Easy-to-use linear and non-linear solver
  ☆51Updated last month
• davidstutz / mesh-evaluation
  Efficient C++ implementation of mesh-to-mesh and mesh-to-point distance.
  ☆60Updated 6 years ago
• alecjacobson / sparse-solver-benchmark
  ☆39Updated 3 years ago
• larc / gproshan
  geometry processing and shape analysis framework
  ☆67Updated 2 months ago
• fwilliams / surface-reconstruction-benchmark
  A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al
  ☆53Updated 8 months ago
• patr-schm / TinyAD
  Automatic Differentiation in Geometry Processing Made Simple
  ☆396Updated last month
• BrunoLevy / pygeogram
  Python bindings for geogram
  ☆21Updated 6 months ago
• rgl-epfl / fastsweep
  Efficient Eikonal equation solver using CUDA
  ☆93Updated 4 months ago
• nmwsharp / neural-implicit-queries
  Queries on neural implicit surfaces via range analysis: ray casting, intersection, closest point, & more. SIGGRAPH 2022 paper. JAX implem…
  ☆175Updated 2 years ago
• GeometryCollective / fieldgen
  Generates high-quality, optimally smooth tangent direction fields on triangle meshes.
  ☆168Updated 2 years ago
• MarcoAttene / CDT
  ☆61Updated last week
• 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
• nmwsharp / vector-heat-demo
  C++ demo of the Vector Heat Method (Sharp, Soliman, and Crane. 2019.)
  ☆62Updated 4 years ago
• patr-schm / TinyAD-Examples
  Code examples for automatic differentiation with TinyAD
  ☆28Updated last month
• GavinBarill / fast-winding-number-soups
  An example that complies and runs the fast winding number for soups
  ☆76Updated 6 years ago
• jiangzhongshi / bichon
  Robust Coarse Curved TetMesh Generation
  ☆36Updated last year