fwilliams / numpyeigenLinks
Fast zero-overhead bindings between NumPy and Eigen
☆143Updated 10 months ago
Alternatives and similar repositories for numpyeigen
Users that are interested in numpyeigen are comparing it to the libraries listed below
Sorting:
- A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]☆148Updated 2 years ago
- An easily integrable Cholesky solver on CPU and GPU☆255Updated 3 weeks ago
- Python Wrapper for Embree☆95Updated 2 years ago
- Optimal Oriented Bounding Boxes algorithms☆50Updated 7 years ago
- Plot 3D triangle meshes☆152Updated last year
- Efficient C++ implementation of mesh-to-mesh and mesh-to-point distance.☆60Updated 7 years ago
- 3D Geometry Renderer for Python☆54Updated 5 years ago
- Build high-quality Laplace matrices on meshes and point clouds in Python. Implements [Sharp & Crane SGP 2020].☆256Updated last year
- ☆39Updated 3 years ago
- Easy-to-use linear and non-linear solver☆56Updated 7 months ago
- Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019☆51Updated last year
- Python bindings for TriWild.☆54Updated last year
- Command Line Tools for Geometry Processing☆42Updated 2 years ago
- An open source library for the GPU-implementation of L-BFGS-B algorithm☆145Updated 5 months ago
- A collection of utility functions to prototype geometry processing research in python☆257Updated 4 months ago
- A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al☆54Updated last year
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆61Updated 7 months ago
- Python bindings for Polyscope☆51Updated this week
- Curvature assignment for Geometry Processing course☆156Updated 2 years ago
- ☆67Updated 6 years ago
- Automatic Differentiation in Geometry Processing Made Simple☆424Updated 3 months ago
- A library providing functionality for the geometric processing of polygonal(non-triangular) meshes.☆61Updated 11 months ago
- Code examples for automatic differentiation with TinyAD☆29Updated 9 months ago
- Generates high-quality, optimally smooth tangent direction fields on triangle meshes.☆176Updated 2 years ago
- Gradients/Hessians for optimizing with rotation variables.☆27Updated 2 years ago
- Implementation of SIGGRAPH 2019 paper: Progressive Embedding☆36Updated 4 years ago
- We approximate the lowest part of the eigenvalues and eigenfunctions of Laplace-Beltrami operator, to have faster speed, less storage, an…☆26Updated 6 years ago
- Codebase for "Variational Surface Cutting" by Sharp & Crane, SIGGRAPH 2018☆106Updated 4 years ago
- ☆23Updated 2 years ago
- geometry processing and shape analysis framework☆69Updated 10 months ago