Alternatives and similar repositories for Parallel-Banding-Algorithm-plus

Users that are interested in Parallel-Banding-Algorithm-plus are comparing it to the libraries listed below

• johnarobinson77 / KdTreeGPU
  A gpu based implementation of a K-D Tree Builder
  ☆114Updated 5 years ago
• sxyu / meshview
  Simple OpenGL mesh/point cloud viewer
  ☆123Updated 2 years ago
• alecjacobson / geometry-processing-curvature
  Curvature assignment for Geometry Processing course
  ☆156Updated 2 years ago
• ingowald / cudaKDTree
  ☆251Updated 2 weeks ago
• aboulch / normals_Hough
  ☆67Updated 4 years ago
• mkazhdan / IsoSurfaceExtraction
  Isosurface extraction from regular voxel grids
  ☆80Updated 8 years ago
• nsubtil / gco-v3.0
  Multi-label optimization library by Olga Veksler and Andrew Delong
  ☆63Updated 6 years ago
• davidstutz / mesh-voxelization
  C++ implementation for computing occupancy grids and signed distance functions (SDFs) from watertight meshes.
  ☆369Updated 3 years ago
• Magnus2 / MeshReconstruction
  Fast and light-weight Marching Cubes library in C++ without any dependencies.
  ☆180Updated 7 years ago
• nmwsharp / navigating-intrinsic-triangulations-demo
  Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019
  ☆51Updated last year
• fwilliams / surface-reconstruction-benchmark
  A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al
  ☆53Updated 10 months ago
• nmwsharp / nonmanifold-laplacian
  A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]
  ☆136Updated last year
• Magnus2 / MeshSdf
  Signed Distance Function from triangle mesh.
  ☆93Updated 6 years ago
• mkazhdan / TextureSignalProcessing
  Gradient-Domain Processing within a Texture Atlas
  ☆74Updated last month
• Totoro97 / Vid2Curve
  Thin structure reconstruction
  ☆198Updated 4 years ago
• InteractiveComputerGraphics / cuNSearch
  A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.
  ☆106Updated last year
• dthuerck / mapmap_cpu
  A high-performance general-purpose MRF MAP solver, heavily exploiting SIMD instructions.
  ☆107Updated 2 years ago
• ChinYing-Li / CUDA-kdtree
  GPU-accelerated KD-tree implementation
  ☆45Updated 3 years ago
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆162Updated 6 years ago
• sebastianlipponer / surface_splatting
  OpenGL demo of a point rendering and texture filtering technique called Surface Splatting.
  ☆240Updated last year
• mkazhdan / EDT
  Euclidean Distance Transform
  ☆19Updated 3 years ago
• rgl-epfl / cholespy
  An easily integrable Cholesky solver on CPU and GPU
  ☆237Updated 7 months ago
• ashwin / gStar4D
  Computes the 3D Delaunay triangulation on the GPU
  ☆129Updated 3 years ago
• 15pengyi / JF-Cut
  JF-Cut: A Parallel Graph Cut Approach for Large Scale Image and Video
  ☆37Updated 9 years ago
• alicevision / geogram
  Git mirror of the geogram library by INRIA
  ☆131Updated 2 years ago
• rodschulz / BPA
  Implementation of The Ball Pivoting Algorithm based on PCL
  ☆63Updated 7 years ago
• fwilliams / numpyeigen
  Fast zero-overhead bindings between NumPy and Eigen
  ☆141Updated 3 months ago
• smidm / Singular-Value-Decomposition
  Quick singular value decomposition as described by: A. McAdams, A. Selle, R. Tamstorf, J. Teran and E. Sifakis, “Computing the Singular V…
  ☆19Updated 11 years ago
• bldeng / MeshSDFilter
  Static/Dynamic Filter for Mesh Geometry
  ☆60Updated 4 years ago
• GavinBarill / fast-winding-number-soups
  An example that complies and runs the fast winding number for soups
  ☆78Updated 6 years ago