Authors:
Adriano Moreira
and
Maribel Yasmina Santos
Affiliation:
University of Minho, Portugal
Keyword(s):
Concave hull, convex hull, polygon, contour, k-nearest neighbours.
Related
Ontology
Subjects/Areas/Topics:
Computer Vision, Visualization and Computer Graphics
;
Geometric Computing
;
Geometry and Modeling
;
Modeling and Algorithms
Abstract:
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.