Skip to Content.
Sympa Menu

cgal-discuss - Constrained Delaunay Triangulations of non-convex polygons and donut-polygons

Subject: CGAL users discussion list

List archive

Constrained Delaunay Triangulations of non-convex polygons and donut-polygons


Chronological Thread 
  • From: Stephen Wong <>
  • To: "" <>
  • Subject: Constrained Delaunay Triangulations of non-convex polygons and donut-polygons
  • Date: Mon, 21 Jan 2008 13:58:39 -0800
  • Accept-language: en-US, en-CA
  • Acceptlanguage: en-US, en-CA

Hello,

 

I have looked at using CGAL for performing triangulation of certain polygons.  They are:

1.       Non-convex polygons where the convex hull(polygon) != polygon

2.       Polygons with an inner hole, i.e. donut polygons.

 

The edges of the polygons are constraints in a Constrained-triangulation.  Is there a convenient way to simply triangulate these kind of polygons, without manually having to remove facets inside the inner hole and/or facets outside the polygon but inside the convex hull?

 

Thank you again,

 

Stephen

 




Archive powered by MHonArc 2.6.16.

Top of Page