Alternatives and similar repositories for octree

Users that are interested in octree are comparing it to the libraries listed below

• brandonpelfrey / SimpleOctree
  A simple octree with good commenting for learning how octrees work.
  ☆261Updated 3 years ago
• CloudCompare / CCCoreLib
  C++ library which provides data structures & algorithms for working with 3D point cloud data
  ☆180Updated last month
• gabyx / ApproxMVBB
  Fast algorithms to compute an approximation of the minimal volume oriented bounding box of a point cloud in 3D.
  ☆463Updated 3 years ago
• OpenGP / sparseicp
  Automatically exported from code.google.com/p/sparseicp
  ☆248Updated 2 years ago
• STORM-IRIT / OpenGR
  OpenGR: A C++ library for 3D Global Registration
  ☆376Updated 7 months ago
• zjudmd1015 / icp
  C++ implementation of 3-dimensional ICP (Iterative Closest Point) method.
  ☆180Updated last year
• aboulch / normals_Hough
  ☆67Updated 4 years ago
• crvs / KDTree
  Simple C++ KD-Tree implementation
  ☆222Updated 11 months ago
• Forceflow / trimesh2
  C++ library and set of utilities for input, output, and basic manipulation of 3D triangle meshes
  ☆329Updated 2 years ago
• YuePanEdward / GH-ICP
  GH-ICP: Iterative Closest Point algorithm with global optimal matching and hybrid metric [3DV' 18]
  ☆458Updated 9 months ago
• nmellado / Super4PCS
  Efficient Global Point-cloud registration
  ☆492Updated 3 years ago
• nmwsharp / happly
  A C++ header-only parser for the PLY file format. Parse .ply happily!
  ☆363Updated last year
• adrelino / mv-lm-icp
  Multiview Levenberg-Marquardt ICP
  ☆243Updated 4 years ago
• codebydant / pointcloudToMesh
  C++ application to convert pcd file, ply file, txt file or xyz point cloud to MESH representation (Gp3).
  ☆176Updated 3 years ago
• JeremyBYU / polylidar
  Polylidar3D - Fast polygon extraction from 3D Data
  ☆321Updated last year
• Magnus2 / MeshReconstruction
  Fast and light-weight Marching Cubes library in C++ without any dependencies.
  ☆179Updated 7 years ago
• yorsh87 / nicp
  Normal Iterative Closest Point (NICP) Algorithm C++ Library
  ☆410Updated 3 years ago
• norlab-ulaval / libnabo
  A fast K Nearest Neighbor library for low-dimensional spaces
  ☆479Updated last month
• dkotfis / Octree-SLAM
  Large octree map construction and rendering with CUDA and OpenGL
  ☆56Updated 10 years ago
• isl-org / FastGlobalRegistration
  Fast Global Registration
  ☆532Updated last year
• AlfonsoLRz / PointCloudRendering
  Fast rendering of large point clouds in OpenGL through compute shaders.
  ☆163Updated 4 months ago
• fzi-forschungszentrum-informatik / gpu-voxels
  GPU-Voxels is a CUDA based library which allows high resolution volumetric collision detection between animated 3D models and live pointc…
  ☆313Updated 2 years ago
• alicevision / geogram
  Git mirror of the geogram library by INRIA
  ☆131Updated 3 years ago
• abner-math / PlaneDetection
  Implementation of my article "A Robust Statistics Approach for Plane Detection in Unorganized Point Clouds"
  ☆255Updated last year
• yaoyx689 / Fast-Robust-ICP
  ☆623Updated last year
• xialinbo / DelaunayTriangulation
  delaunay triangulation in 3D space, to reconstruct convex hull from spherical dot cloud
  ☆76Updated 6 years ago
• gishi523 / kd-tree
  An implementation of k-d tree
  ☆185Updated last year
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆168Updated 7 years ago
• fverdoja / Fast-3D-Pointcloud-Segmentation
  Fast 3D point cloud segmentation using supervoxels with geometry and color for 3D scene understanding
  ☆233Updated 5 years ago
• akuukka / quickhull
  C++ implementation of the 3D QuickHull algorithm
  ☆290Updated last year