Concave hull: A k-nearest neighbours algorithm

Version 1.0.0 (1.36 MB) by Andreas Bernatzky
Concave hull: A k-nearest neighbours approach for the computation of the region occupied by a set of points
0.0
(0)
218 Downloads
Updated 15 Jan 2024
View License on GitHub

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.

Cite As

Andreas Bernatzky (2026). Concave hull: A k-nearest neighbours algorithm (https://github.com/TypHo22/ConcaveHull), GitHub. Retrieved .

https://www.researchgate.net/publication/220868874_Concave_hull_A_k-nearest_neighbours_approach_for_the_computation_of_the_region_occupied_by_a_set_of_points

MATLAB Release Compatibility
Created with R2019b
Compatible with any release
Platform Compatibility
Windows macOS Linux
Categories
Find more on Bounding Regions in Help Center and MATLAB Answers
Tags Add Tags

lineIntersection

Versions that use the GitHub default branch cannot be downloaded

Version Published Release Notes
1.0.0

To view or report issues in this GitHub add-on, visit the GitHub Repository.
To view or report issues in this GitHub add-on, visit the GitHub Repository.