ingowald / closestSurfacePointQueriesLinks
Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point
☆24Updated 3 years ago
Alternatives and similar repositories for closestSurfacePointQueries
Users that are interested in closestSurfacePointQueries are comparing it to the libraries listed below
Sorting:
- 'cubicle' - a CUDA-centric BVH query library (kNN, find closest point, etc)☆27Updated 2 months ago
- ☆39Updated 3 years ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆57Updated last month
- C++ library for fast computation of neighbor lists in point clouds.☆57Updated 6 months ago
- ☆51Updated last year
- ☆61Updated last week
- A projection-based bijective map definition and a robust algorithm to construct the prismatic shell domain. https://cs.nyu.edu/~zhongshi/…☆27Updated 4 years ago
- Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019☆51Updated 11 months ago
- A robust cut-cell mesh generator for arbitrary triangle-mesh inputs☆81Updated last year
- ☆11Updated 5 months ago
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆26Updated 3 years ago
- Fast CUDA 3x3 SVD☆73Updated 6 years ago
- Convex Polyhedral Meshing for Robust Solid Modeling☆56Updated last week
- Signed Distance Function from triangle mesh.☆93Updated 6 years ago
- Gradients/Hessians for optimizing with rotation variables.☆26Updated 2 years ago
- Source code for serveral papers on discrete Laplace operators on general polygons and polyhedral meshes☆38Updated last year
- ☆31Updated last year
- Exact floating-point implementation of root parity CCD [Wang et al. 2022]☆34Updated 2 years ago
- ☆55Updated 5 years ago
- Code for paper "P2M: A Fast Solver for Querying Distance from Point to Mesh Surface". ACM TOG (SIGGRAPH 2023).☆24Updated 8 months ago
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 4 years ago
- Compute one-side Hausdorff distance between triangle meshes with error bound.☆28Updated 2 years ago
- Implementation of our paper "Polygon Laplacian Made Simple", Eurographics 2020.☆36Updated 4 years ago
- An example that complies and runs the fast winding number for soups☆76Updated 6 years ago
- Indirect Predicates for Geometric Constructions☆46Updated last month
- Gaggle of Algorithms and Utilities for Simulating Stuff☆31Updated 2 years ago
- injective mapping via TLC (total lifted content) energy minimization (SIGGRAPH 2020)☆18Updated 4 years ago
- FastCorotatedFEM is a minimalistic implementation of the corotated FEM method which was proposed in paper "Fast Corotated FEM using Opera…☆75Updated 6 years ago
- ☆20Updated 4 years ago
- ☆19Updated 4 years ago