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

• mkazhdan / IsoSurfaceExtraction
  Isosurface extraction from regular voxel grids
  ☆78Updated 7 years ago
• johnarobinson77 / KdTreeGPU
  A gpu based implementation of a K-D Tree Builder
  ☆108Updated 5 years ago
• alecjacobson / geometry-processing-registration
  Registration assignment for Geometry Processing course
  ☆89Updated 2 years ago
• nmwsharp / nonmanifold-laplacian
  A robust Laplace matrix for general (possibly nonmanifold) triangle meshes, and point clouds [Sharp & Crane SGP 2020]
  ☆133Updated 11 months ago
• sxyu / meshview
  Simple OpenGL mesh/point cloud viewer
  ☆115Updated 2 years ago
• fwilliams / surface-reconstruction-benchmark
  A working copy of the code from "A Benchmark for Surface Reconstruction" by Berger et. Al
  ☆52Updated 4 months ago
• davidstutz / mesh-voxelization
  C++ implementation for computing occupancy grids and signed distance functions (SDFs) from watertight meshes.
  ☆362Updated 2 years ago
• davidstutz / mesh-evaluation
  Efficient C++ implementation of mesh-to-mesh and mesh-to-point distance.
  ☆58Updated 6 years ago
• alecjacobson / geometry-processing-curvature
  Curvature assignment for Geometry Processing course
  ☆151Updated last year
• ChinYing-Li / CUDA-kdtree
  GPU-accelerated KD-tree implementation
  ☆42Updated 3 years ago
• GavinBarill / fast-winding-number-soups
  An example that complies and runs the fast winding number for soups
  ☆69Updated 6 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
  ☆127Updated 2 years ago
• mkazhdan / EDT
  Euclidean Distance Transform
  ☆19Updated 2 years ago
• dcoeurjo / VolGallery
  A gallery of volumetric images and objects
  ☆24Updated 4 years ago
• Magnus2 / MeshReconstruction
  Fast and light-weight Marching Cubes library in C++ without any dependencies.
  ☆174Updated 7 years ago
• nmwsharp / navigating-intrinsic-triangulations-demo
  Demo code for "Navigating Intrinsic Triangulations". Sharp, Soliman, and Crane. 2019
  ☆49Updated 6 months ago
• ingowald / cudaKDTree
  ☆215Updated last week
• Philip-Trettner / probabilistic-quadrics
  Reference implementation of the Eurographics 2020 paper "Fast and Robust QEF Minimization using Probabilistic Quadrics"
  ☆51Updated 3 months ago
• alecjacobson / geometry-processing-mesh-reconstruction
  Mesh Reconstruction assignment for Geometry Processing course
  ☆107Updated 2 years ago
• owensgroup / RXMesh
  GPU-accelerated triangle mesh processing
  ☆240Updated this week
• adshhzy / VIPSS
  ☆53Updated 4 years ago
• ericjang / svd3
  Fast singular value decomposition, diagonalization, QR decomposition of 3x3 matrices.
  ☆151Updated 3 years ago
• ilastik / marching_cubes
  Standalone marching cubes implementation and Python bindings
  ☆98Updated last year
• larc / gproshan
  geometry processing and shape analysis framework
  ☆65Updated last month
• InteractiveComputerGraphics / cuNSearch
  A C++/CUDA library to efficiently compute neighborhood information on the GPU for 3D point clouds within a fixed radius.
  ☆99Updated 8 months ago
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆147Updated 6 years ago
• mlivesu / GraphCuts
  This is a C++11 friendly mirror of GraphCuts. It generates no warnings when compiled on MacOS with clang
  ☆14Updated 6 years ago
• fedassa / SHOT
  C++ implementation of the SHOT 3D descriptor
  ☆59Updated 3 years ago
• alecjacobson / geometry-processing-introduction
  Introductory assignment for Geometry Processing course
  ☆119Updated 2 years ago