Can anyone suggest me an algorithm which instead of filling an area, returns me a list of points which are “border” of this area?
Share
Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Can anyone suggest me an algorithm which instead of filling an area, returns me a list of points which are “border” of this area?
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).