Please use this identifier to cite or link to this item:

TitleConcave hull: a k-nearest neighbours approach for the computation of the region occupied by a set of points
Author(s)Moreira, Adriano
Santos, Maribel Yasmina
KeywordsConcave hull
Convex hull
k-Nearest neighbours
Polygon, contour
Issue date8-Mar-2007
PublisherINSTICC Press
CitationINTERNATIONAL 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.
Abstract(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.
TypeConference paper
DescriptionThere is an on-line version of the Concave Hull algorithm at:
Publisher version
AccessOpen access
Appears in Collections:CAlg - Artigos em livros de atas/Papers in proceedings
DSI - Engenharia da Programação e dos Sistemas Informáticos

Files in This Item:
File Description SizeFormat 
ConcaveHull_ACM_MYS.pdfPaper, as published in the conference proceedings1,38 MBAdobe PDFView/Open

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 ORCID