Alternatives and similar repositories for concaveman-cpp

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

• JeremyBYU / polylidar
  Polylidar3D - Fast polygon extraction from 3D Data
  ☆315Updated last year
• abellgithub / delaunator-cpp
  A really fast C++ library for Delaunay triangulation of 2D points
  ☆182Updated 2 months ago
• senhorsolar / concavehull
  Finds the concave hull around a set of points by leveraging the Delaunay triangulation
  ☆37Updated 8 months ago
• jklimke / libcitygml
  C++ Library for CityGML Parsing and Visualization
  ☆102Updated 3 months ago
• kleunen / boost_geometry_correct
  Advanced correct for boost geometry polygons
  ☆35Updated 3 years ago
• tudelft3d / masbcpp
  C++ implementation of the Medial Axis Shrinking Ball algorithm
  ☆125Updated 4 years ago
• msokalski / delabella
  2D Delaunay triangulation (dela) - super stable (bella!)
  ☆236Updated last year
• delfrrr / delaunator-cpp
  A really fast C++ library for Delaunay triangulation of 2D points
  ☆550Updated last year
• CloudCompare / CCCoreLib
  C++ library which provides data structures & algorithms for working with 3D point cloud data
  ☆175Updated 3 weeks ago
• adasta / osgpcl
  ☆65Updated 10 years ago
• alicevision / geogram
  Git mirror of the geogram library by INRIA
  ☆129Updated 2 years ago
• ashwin / gDel3D
  gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.
  ☆160Updated 6 years ago
• AlfonsoLRz / PointCloudRendering
  Fast rendering of large point clouds in OpenGL through compute shaders.
  ☆155Updated last month
• mapbox / wagyu
  A general library for geometry operations of union, intersections, difference, and xor
  ☆180Updated last year
• jbehley / octree
  Fast radius neighbor search with an Octree (ICRA 2015)
  ☆364Updated 5 years ago
• Forceflow / trimesh2
  C++ library and set of utilities for input, output, and basic manipulation of 3D triangle meshes
  ☆326Updated last year
• gabyx / ApproxMVBB
  Fast algorithms to compute an approximation of the minimal volume oriented bounding box of a point cloud in 3D.
  ☆459Updated 3 years ago
• m-schuetz / Skye
  Progressive Real-Time Rendering of Large Point Clouds without Hierarchical Acceleration Structures
  ☆155Updated 4 years ago
• libigl / triangle
  This is a mirror of the latest stable version of Triangle.
  ☆141Updated 2 months ago
• jbegaint / delaunay-cpp
  C++11 Delaunay triangulation implementation (Bowyer-Watson)
  ☆86Updated 7 years ago
• Botffy / polyskel
  Straight skeleton implementation in Python
  ☆83Updated 4 years ago
• xialinbo / DelaunayTriangulation
  delaunay triangulation in 3D space, to reconstruct convex hull from spherical dot cloud
  ☆76Updated 6 years ago
• thomasmoelhave / TerraNNI
  TerraNNI interpolates grid DEMs from large 2D and 3D point clouds using a variant of natural neighbor interpolation.
  ☆46Updated 11 years ago
• asmaloney / libE57Format
  Library for reading & writing the E57 file format
  ☆151Updated last month
• NLeSC / Massive-PotreeConverter
  Convert massive pointcloud, for example ahn2 (640 Billion points) to potree format.
  ☆82Updated 5 years ago
• OpenTopography / points2grid
  Points2Grid is a robust and scalable tool for gridding LIDAR point cloud data to generate Digital Elevation Models (DEM). Points2Grid use…
  ☆89Updated 4 years ago
• CRREL / points2grid
  Generate digital elevation models from 3D point clouds
  ☆87Updated 8 years ago
• ashwin / gStar4D
  Computes the 3D Delaunay triangulation on the GPU
  ☆128Updated 3 years ago
• LASzip / LASzip
  ☆214Updated 4 months ago
• Jean-Romain / RcppConcaveman
  A very fast 2D concave hull algorithm
  ☆11Updated 3 years ago