sadaszewski / concaveman-cpp
C++ port of mapbox's JS concaveman, with a Python wrapper
☆151Updated last year
Related projects: ⓘ
- Polylidar3D - Fast polygon extraction from 3D Data☆303Updated 8 months ago
- C++ implementation of the Medial Axis Shrinking Ball algorithm☆110Updated 3 years ago
- A really fast C++ library for Delaunay triangulation of 2D points☆499Updated 7 months ago
- C++ Library for CityGML Parsing and Visualization☆97Updated 2 weeks ago
- gDel3D is the fastest 3D Delaunay triangulation algorithm. It uses the GPU for massive parallelism.☆141Updated 6 years ago
- A really fast C++ library for Delaunay triangulation of 2D points☆145Updated 2 weeks ago
- Advanced correct for boost geometry polygons☆31Updated 2 years ago
- Library for reading & writing the E57 file format☆131Updated 2 months ago
- 2D Delaunay triangulation (dela) - super stable (bella!)☆221Updated 7 months ago
- Git mirror of the geogram library by INRIA☆122Updated 2 years ago
- Progressive Real-Time Rendering of Large Point Clouds without Hierarchical Acceleration Structures☆144Updated 3 years ago
- Alternative LAZ implementation for C++ and JavaScript☆74Updated 2 months ago
- Generate digital elevation models from 3D point clouds☆87Updated 7 years ago
- ☆65Updated 9 years ago
- Convert massive pointcloud, for example ahn2 (640 Billion points) to potree format.☆80Updated 4 years ago
- Kd-Tree library for kNN and range queries in plain C++98☆80Updated 8 months ago
- Wykobi C++ Computational Geometry Library https://www.wykobi.com☆164Updated 8 months ago
- C++ library which provides data structures & algorithms for working with 3D point cloud data☆151Updated 2 weeks ago
- C++11 Delaunay triangulation implementation (Bowyer-Watson)☆83Updated 6 years ago
- This is a mirror of the latest stable version of Triangle.☆123Updated 2 years ago
- Fast algorithms to compute an approximation of the minimal volume oriented bounding box of a point cloud in 3D.☆442Updated 2 years ago
- C++ library and programs for reading and writing ASPRS LAS format with LiDAR data☆306Updated this week
- ☆63Updated 3 years ago
- Finds the concave hull around a set of points by leveraging the Delaunay triangulation☆31Updated 2 years ago
- Fast radius neighbor search with an Octree (ICRA 2015)