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.
I have a polygon, one in three types: convex, non-convex, with holes) that include sa list of vertices (point x,y) and edges (start point, end point). Now I have to find one point to put a label within the polygon and is center of largest part. How do I do that?
A good way to start from is IMO
http://en.wikipedia.org/wiki/Centroid and
http://en.wikipedia.org/wiki/K-means_clustering
At the end of the latter you find some links to implementations, maybe these are of help for you.