sebastianlipponer / zorder_knn
Floating point morton order comparison operator.
☆13Updated 8 months ago
Alternatives and similar repositories for zorder_knn:
Users that are interested in zorder_knn are comparing it to the libraries listed below
- ☆46Updated 2 years ago
- A library with space-filling curve algorithms (analysis, neighbor-finding, visualization) and other utilities (math, geometry, image proc…☆24Updated 7 years ago
- ☆62Updated last year
- Little helper project that builds a BVH over triangles, and allows for querying closest surface point for given input point☆24Updated 3 years ago
- Public code release for "Swept Volumes via Spacetime Numerical Continuation", presented at SIGGRAPH 2021 and authored by Silvia Sellán, N…☆55Updated 6 months ago
- C++ library for fast computation of neighbor lists in point clouds.☆55Updated last month
- A gpu based implementation of a K-D Tree Builder☆108Updated 5 years ago
- A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.☆99Updated 8 months ago
- 2d medial axis transform using tracing paths [Joan-Arinyo et al.]☆32Updated 5 years ago
- TriMe++: a multi-threaded software library for 2D geometry meshing using the Delaunay triangulation☆10Updated last month
- EGGS, a method to speed up sparse matrix operations when the same sparsity is used for multiple times. This repo contains examples that s…☆25Updated 4 years ago
- ☆53Updated 4 years ago
- A Collection of Parallel Algorithms for Computational Geometry☆12Updated 2 years ago
- Delaunay Triangulation☆9Updated 5 years ago
- Mepp2 - 3D MEsh Processing Platform☆76Updated 2 years ago
- ☆215Updated last week
- Ponca (fomerly known as Patate) is a header only C++/CUDA library for point cloud analysis☆33Updated 2 months ago
- A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al☆52Updated 4 months ago
- Kd-Tree library for kNN and range queries in plain C++98☆87Updated last year
- Reference implementation of Oi-BVH tree from the paper "Binary Ostensibly‐Implicit Trees for Fast Collision Detection"☆31Updated 3 years ago
- GPU-accelerated KD-tree implementation☆42Updated 3 years ago
- robust geometric predicates☆35Updated 4 years ago
- Compute one-side Hausdorff distance between triangle meshes with error bound.☆28Updated 2 years ago
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆147Updated 6 years ago
- Field interpolation using finite elements and sparse linear least squares☆17Updated 3 years ago
- ☆45Updated 7 years ago
- A library providing functionality for the geometric processing of polygonal(non-triangular) meshes.☆61Updated 4 months ago
- Open source code for SIGGRAPH 2022 journal paper TopoCut.☆25Updated 2 years ago
- Interpolated corrected curvature measures for polygonal surfaces☆14Updated 10 months ago
- ☆142Updated last year