Veuillez utiliser cette adresse pour citer ce document:

TitreConcave hull : a k-nearest neighbours approach for the computation of the region occupied by a set of points
Auteur(s)Moreira, Adriano
Santos, Maribel Yasmina
Mots-clésConcave hull
Convex hull
k-Nearest neighbours
Polygon, contour
EditeurInsticc Press (institute for Systems and Technologies of Information, Control and Communication)
Référence bibliographiqueINTERNATIONAL CONFERENCE ON COMPUTER GRAPHICS THEORY AND APPLICATIONS, 2, Barcelona, Spain, 2007 – “GRAPP 2007 : proceedings of the International Conference on Computer Graphics Theory and Applications”. [Setúbal] : INSTICC Press, 2007. ISBN 978-972-8865-71-9. p. 61-68.
Résumé(s)This paper describes an algorithm to compute the envelope of a set of points in a plane, which generates convex or non-convex hulls that represent the area occupied by the given points. 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 obtained results show that this algorithm is able to deal with arbitrary sets of points, and that the time to compute the polygons increases approximately linearly with the number of points.
DescriptionThere is an on-line version of the Concave Hull algorithm at:
Arbitrage scientifiqueyes
Il apparaît dans les collections:DSI - Engenharia da Programação e dos Sistemas Informáticos
CAlg - Artigos em livros de atas/Papers in proceedings

Fichiers de ce Registre:
Fichier Description TailleFormat 
ConcaveHull_ACM_MYS.pdfPaper, as published in the conference proceedings1,38 MBAdobe PDFVoir/Ouvrir

Partilhe no FacebookPartilhe no TwitterPartilhe no DeliciousPartilhe no LinkedInPartilhe no DiggAdicionar ao Google BookmarksPartilhe no MySpacePartilhe no Orkut
Exporte no formato BibTex mendeley Exporte no formato Endnote Adicione ao seu Currículo DeGóis