Reputation: 3558
Can anyone suggest me an algorithm which instead of filling an area, returns me a list of points which are "border" of this area?
Upvotes: 2
Views: 530
Reputation: 33827
Flood fill, or you can process your image and traverse edges. Depends on your input.
Upvotes: 1
Reputation: 14309
What you want is to find the Convex hull of a point set, then find the supporting points of the convex hull.
You can actually reuse the C++ CGAL library for this purpose (which is IMO state of the art in that field).
Upvotes: 2