Alternatives and similar repositories for delaunay-cpp

Users that are interested in delaunay-cpp are comparing it to the libraries listed below

• DengMen / learnCGAL
  learn cgal by demo
  ☆188Updated 5 years ago
• xialinbo / DelaunayTriangulation
  delaunay triangulation in 3D space, to reconstruct convex hull from spherical dot cloud
  ☆76Updated 6 years ago
• cgtuebingen / pointcloud-viewer
  Efficient Large-Scale Point-Cloud Viewer based on OpenGL
  ☆84Updated 5 years ago
• bl4ckb0ne / delaunay-triangulation
  C++ version the delaunay triangulation
  ☆447Updated 4 years ago
• Forceflow / trimesh2
  C++ library and set of utilities for input, output, and basic manipulation of 3D triangle meshes
  ☆325Updated last year
• adasta / osgpcl
  ☆65Updated 10 years ago
• lihy96 / MeshSimplify
  Mesh Simplification based on edge-collapse algorithm
  ☆131Updated last year
• jbehley / octree
  Fast radius neighbor search with an Octree (ICRA 2015)
  ☆364Updated 5 years ago
• brandonpelfrey / SimpleOctree
  A simple octree with good commenting for learning how octrees work.
  ☆258Updated 3 years ago
• chnhideyoshi / SimplifiedQSlimLibrary
  Simplified QSlim Library Code Blocks (QSlim库简化版本，兼容了标准Mesh定义，剥离了冗余代码)
  ☆16Updated 11 years ago
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆159Updated 6 years ago
• sadaszewski / concaveman-cpp
  C++ port of mapbox's JS concaveman, with a Python wrapper
  ☆160Updated 2 years ago
• hanyangii / DelaunayTriangulation2D
  Divide and Conquer Algorithm for Delaunay Triangulation in 2D space
  ☆20Updated last year
• crvs / KDTree
  Simple C++ KD-Tree implementation
  ☆217Updated 7 months ago
• delfrrr / delaunator-cpp
  A really fast C++ library for Delaunay triangulation of 2D points
  ☆547Updated last year
• kleunen / boost_geometry_correct
  Advanced correct for boost geometry polygons
  ☆35Updated 3 years ago
• alicevision / geogram
  Git mirror of the geogram library by INRIA
  ☆129Updated 2 years ago
• sapphous / BowyerWatson
  Implementation of the Bowyer-Watson algorithm (with modified Lloyd relaxation) for finding Delaunay triangulations of point sets on the u…
  ☆15Updated 7 years ago
• MeteorCh / OSG-OBB-and-AABB-BOX
  OSG中，计算模型的OBB包围盒和AABB包围盒并绘制
  ☆32Updated 5 years ago
• aijm / BSplineSurface
  B-Spline surface (Qt & OpenGL)
  ☆21Updated 7 years ago
• momower1 / PointCloudEngine
  Point Cloud Rendering Engine with Octree Generation, Splat Blending, Phong Lighting and Neural Network Evaluation
  ☆10Updated 2 years ago
• Ubpa / UHEMesh
  an elegant, high-performance and user-friendly halfedge data structure
  ☆83Updated 4 years ago
• mylxiaoyi / osg3
  OpenSceneGraph 3.0 Beginner's Guide
  ☆47Updated 5 years ago
• kaiwu119 / Delaunay
  This code is used to implement the Delaunay triangulation algorithm and visualize
  ☆14Updated 5 years ago
• UnaNancyOwen / qt_visualizer
  ☆15Updated 7 years ago
• abellgithub / delaunator-cpp
  A really fast C++ library for Delaunay triangulation of 2D points
  ☆179Updated last month
• CloudCompare / CCCoreLib
  C++ library which provides data structures & algorithms for working with 3D point cloud data
  ☆175Updated this week
• nmoehrle / rayint
  Simple ray intersection library similar to coldet - succedeed by libacc
  ☆37Updated 8 years ago
• naspert / MESH
  Measuring Error between Surface using the Hausdorff distance
  ☆15Updated 13 years ago
• cdalitz / kdtree-cpp
  Kd-Tree library for kNN and range queries in plain C++98
  ☆93Updated last year