A very fast 2D concave hull algorithm, for python
-
Updated
Oct 3, 2024 - C++
#
2d-concave-hull
Here are 2 public repositories matching this topic...
This program generates a concave hull (an envelope surrounding the point data set) around any two-dimensional data set. The algorithm uses K-nearest neighbour approach to compute the concave hull. This approach is based on the paper "CONCAVE HULL: A K-NEAREST NEIGHBOURS APPROACH FOR THE COMPUTATION OF THE REGION OCCUPIED BY A SET OF POINTS," GRA…
-
Updated
Jun 19, 2017 - MATLAB
Improve this page
Add a description, image, and links to the 2d-concave-hull topic page so that developers can more easily learn about it.
Add this topic to your repo
To associate your repository with the 2d-concave-hull topic, visit your repo's landing page and select "manage topics."