qnzhou / nanosplineLinks
A nano spline library in modern C++.
☆124Updated 10 months ago
Alternatives and similar repositories for nanospline
Users that are interested in nanospline are comparing it to the libraries listed below
Sorting:
- Header-only single-class implementation of Quickhull algorithm for convex hulls finding in arbitrary dimension (>1) space.☆77Updated 2 years ago
- Fast and lightweight class for Bezier curves of any order in C++☆106Updated last week
- A C++ geometry processing library☆50Updated 4 years ago
- A library providing functionality for the geometric processing of polygonal(non-triangular) meshes.☆61Updated 6 months ago
- This is an implementation of the paper "Exact and Efficient Polyhedral Envelope Containment Check". The algorithm conservatively predict…☆57Updated last month
- Single file, header-only, no-dependencies C library for Poisson disk sampling in arbitrary dimensions.☆120Updated 7 months ago
- C++ implementation of the 3D QuickHull algorithm☆288Updated last year
- A simple, easily hackable C++ surface voxelizer (STL=>voxels)☆179Updated 4 years ago
- Public code release for "Swept Volumes via Spacetime Numerical Continuation", presented at SIGGRAPH 2021 and authored by Silvia Sellán, N…☆66Updated last year
- A header-only C implementation of the Quickhull algorithm for building N-dimensional Convex Hulls and Delaunay meshes☆146Updated 4 months ago
- Construct geodesic paths, loops, networks on surface with a fast and simple edge flipping algorithm. C++ demo app and more.☆106Updated 2 years ago
- Robust geometric predicates☆61Updated last year
- Header only, single file, simple and efficient C++11 library to compute the signed distance function (SDF) to a triangle mesh☆176Updated last year
- A library to collect many useful spline functions into one place.☆286Updated 3 years ago
- C++ library and set of utilities for input, output, and basic manipulation of 3D triangle meshes☆328Updated 2 years ago
- Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"☆55Updated 11 months ago
- Classes that demonstrate how to use Sturm's Theroem for root finding to solve the 5th degree polynomial required to project a 3D point to…☆31Updated 6 years ago
- Fast and light-weight Marching Cubes library in C++ without any dependencies.☆180Updated 7 years ago
- C++ routines to compute spline curves in nD☆41Updated 6 years ago
- Discrete Conformal Equivalence of Polyhedral Surfaces☆105Updated 2 years ago
- Header only C++ library for decomposing and slicing concave polygons into convex polygons☆72Updated 4 years ago
- Git mirror of the geogram library by INRIA☆131Updated 3 years ago
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆165Updated 7 years ago
- robust geometric predicates☆37Updated 4 years ago
- A library for performing proximity queries on a pair of geometric models composed of triangles☆77Updated 4 years ago
- C++ headers for mapping values to colors and creating PPM images from them☆60Updated 3 years ago
- This is the header-only version of the code we used for the experiments in the paper "Fast and Robust Mesh Arrangements using Floating-po…☆160Updated last year
- Directional Field Synthesis, Design, and Processing☆84Updated 4 years ago
- Fast singular value decomposition, diagonalization, QR decomposition of 3x3 matrices.☆159Updated 3 years ago
- A conservative continuous collision detection (CCD) method with support for minimum separation. [Wang et al. 2021]☆145Updated 3 months ago