If you want to do more complicated things, I suggest to use the
2D constrained triangulation with the projection traits (like
in the implementation of the aforementioned function). With it
you'll be able to have constrained edges as well as intersection
of constrained edges (computed automatically).
On 03/27/2018 02:54 AM, Jayesh Badwaik wrote:
> I habe described my problem in the attached PDF. I would be very
> grateful if someone can tell me if this can be done in CGAL. Or point
> me to some algorithms related to this.