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 am working on terrain rendering tool currently. I have to cut a piece from a given Delaunay triangulation. Suppose following triangulation is given:
The red square depicts area to cut from the original triangulation, i.e. find sub triangulation which has the same points as the original triangulation plus points on the square’s border.
Is there any kind efficient algorithm to perform such cut?
You need to use a constrained Delaunay triangulation.
The CGAL library for example provides an implementation in C++. As you talk about terrain, you should also look at this example.
If you are interested in a java or python implementation, some bindings written with SWIG are available here.