GeometryCollective / wost-simple
Simple didactic code + tutorial for the Walk on Stars (WoSt) algorithm
☆83Updated last year
Related projects ⓘ
Alternatives and complementary repositories for wost-simple
- Grid-Free Monte Carlo PDE solvers☆154Updated last month
- Author's implementation of SIGGRAPH 2023 paper, "A Practical Walk-on-Boundary Method for Boundary Value Problems."☆51Updated last year
- A simple parametric model of plain-knit yarn curves, with C code and other resources.☆51Updated last year
- ☆47Updated 4 months ago
- Discrete Conformal Equivalence of Polyhedral Surfaces☆100Updated last year
- Extension of pbrt-v3 implementing the SIGGRAPH NA 2023 paper "A Practical Walk-on-Boundary Method for Boundary Value Problems"☆16Updated last year
- A curated collection of Python examples for optimization-based solid simulation, emphasizing algorithmic convergence, penetration-free, a…☆165Updated 3 months ago
- Course material for CMU course on Monte Carlo Methods and Applications☆23Updated last year
- An introductory course intrinsic triangulations for powerful & robust geometry processing --- tutorial code and links.☆123Updated 2 years ago
- Toolkit for Meshing in the Wild☆116Updated this week
- CreativeCommons 3D surface mesh dataset created by students in CMU's intro graphics course☆36Updated 3 years ago
- Generates high-quality, optimally smooth tangent direction fields on triangle meshes.☆163Updated last year
- Geometry processing research tutorial in python - as presented at SGP 2024.☆51Updated 4 months ago
- ☆51Updated 3 months ago
- ☆48Updated 6 months ago
- A curated set of C++ examples for optimization-based elastodynamic contact simulation using CUDA, emphasizing algorithmic convergence, pe…☆75Updated 3 months ago
- A template project to get started with geometry-central and Polyscope.☆52Updated 8 months ago
- C++ library for fast computation of neighbor lists in point clouds.☆54Updated last year
- A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]☆131Updated 9 months ago
- ☆31Updated 6 months ago
- Code for the Siggraph 2023 Paper: Shortest Path to Boundary for Self-Intersecting Meshes☆84Updated 9 months ago
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆134Updated 5 months ago
- Bidirectional WoS☆17Updated 2 years ago
- The code of paper "Adaptive grid generation for discretizing implicit complexes" (Proc. SIGGRAPH 2024)☆17Updated last month
- c++ optimal transport solver on 2D grids☆52Updated 4 years ago
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆164Updated 3 months ago
- Command Line Tools for Geometry Processing☆39Updated 9 months ago
- Gradients/Hessians for optimizing with rotation variables.☆25Updated last year
- This is a mirror of the latest stable version of Tetgen.☆94Updated last year
- ☆17Updated last month