Please use this identifier to cite or link to this item:
https://hdl.handle.net/1822/6429| Title: | Concave 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 |
| Keywords: | Concave hull Convex hull Polygon Contour k-Nearest neighbours Polygon, contour |
| Issue date: | 8-Mar-2007 |
| Publisher: | INSTICC Press |
| Citation: | INTERNATIONAL 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. |
| Type: | Conference paper |
| Description: | There is an on-line version of the Concave Hull algorithm at: http://local.dsi.uminho.pt |
| URI: | https://hdl.handle.net/1822/6429 |
| ISBN: | 978-972-8865-71-9 |
| Publisher version: | http://grapp.visigrapp.org/grapp2007/index.htm |
| Peer-Reviewed: | yes |
| Access: | Open access |
| Appears in Collections: | DSI - Engenharia da Programação e dos Sistemas Informáticos |
Files in This Item:
| File | Description | Size | Format | |
|---|---|---|---|---|
| ConcaveHull_ACM_MYS.pdf | Paper, as published in the conference proceedings | 1,38 MB | Adobe PDF | View/Open |
