I have to make 2d triangles from a list of 2d points with a condition: length of any edge can’t be longer than a predefined constant.
Something like this:
Do you know any algorithm that can do this? Or any advise?
Thanks!
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.
I have to make 2d triangles from a list of 2d points with a condition: length of any edge can’t be longer than a predefined constant.
Something like this:
Do you know any algorithm that can do this? Or any advise?
Thanks!
Try Delaunay triangulation, then remove any edges which are too long.
From the above article, you see a link to CGAL’s 2D triangulation page.