Concave hull: A k-nearest neighbours algorithm
Updated 09 Feb 2020
The proposed algorithm is based on a k-nearest neighbours approach, where the value of k, the only algorithm parameter, is used to
control the “smoothness” of the final solution.
The idea of the algorithm belongs to:
Moreira, Adriano & Santos, Maribel. (2007). Concave hull: A k-nearest neighbours approach for the computation of the region occupied by a set of points.. 61-68.
Andreas Bernatzky (2021). Concave hull: A k-nearest neighbours algorithm (https://github.com/TypHo22/ConcaveHull), GitHub. Retrieved .
MATLAB Release Compatibility
Platform CompatibilityWindows macOS Linux
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!Start Hunting!