Skip to Content.
Sympa Menu

cgal-discuss - [cgal-discuss] Intersection of curve with 2D polygon

Subject: CGAL users discussion list

List archive

[cgal-discuss] Intersection of curve with 2D polygon


Chronological Thread 
  • From: Manav Bhatia <>
  • To:
  • Subject: [cgal-discuss] Intersection of curve with 2D polygon
  • Date: Sat, 9 Dec 2017 15:03:08 -0600
  • Authentication-results: mail2-smtp-roc.national.inria.fr; spf=None ; spf=Pass ; spf=None
  • Ironport-phdr: 9a23:JCa6eRHfy44C6bCgYD/LOp1GYnF86YWxBRYc798ds5kLTJ76oc2wAkXT6L1XgUPTWs2DsrQf1LqQ7viocFdDyKjCmUhKSIZLWR4BhJdetC0bK+nBN3fGKuX3ZTcxBsVIWQwt1Xi6NU9IBJS2PAWK8TXhpQIVTx7wPA4wKuXuEZPJlOy20fqz8tvdeVZmnj24NJZ7Khyo5S/Rv9UXiMM2IKY41hrAp3JOcvp+ymZhJFbVlBH5sJTjtKV/+jhd7qpyv/VLVr/3Kvw1
Hi,

I have an application where a curve in 2D-space and a 2D polygon are given
and the objective is:
— to find the intersection of these two entities
— if they intersect, the polygon needs to be divided into a set of
sub-polygons (or triangles) the union of which defines the portion of the
original polygon on either side of the curve.

What would be the best approach to accomplish this with CGAL?

As an extension, what would be the best approach to accomplish this for
intersection of a surface in 3D with a hexahedron?

I would greatly appreciate your help.

Regards,
Manav



Archive powered by MHonArc 2.6.18.

Top of Page