Concave hull: A k-nearest neighbours algorithm

versión 1.0.0 (1.31 MB) por Andreas Bernatzky
Concave hull: A k-nearest neighbours approach for the computation of the region occupied by a set of points

109 descargas

Actualizada 9 Feb 2020

De GitHub

Ver licencia en 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.

Citar como

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

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

Compatibilidad con la versión de MATLAB
Se creó con R2019b
Compatible con cualquier versión
Compatibilidad con las plataformas
Windows macOS Linux

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!
Para consultar o informar de algún problema sobre este complemento de GitHub, visite el repositorio de GitHub.
Para consultar o informar de algún problema sobre este complemento de GitHub, visite el repositorio de GitHub.