CGAL users discussion list

[Monique Teillaud <>]

Hi,

Doesn't CGAL::Constrained_triangulation_2 fulfill your needs?

Best,
--
Monique Teillaud
http://www.loria.fr/~teillaud/
INRIA Nancy - Grand Est, LORIA
Institut National de Recherche en Informatique et Automatique

Le 30/06/15 09:40, simon.anderson a écrit :
> Hi there,
>
> I'm currently using partitioning (approx_convex_partition_2) in order to
> partition up my concave polygons into convex polygons so I can triangulate
> it properly.
>
> It's in the shape of a winding road - it's quite large and is taking between
> 10-20 seconds to compute the partitions.
>
> I was hoping someone had some advice as to whether there was a more
> efficient way to do it:
>
> Should I instead try and find the alpha shape and triangulate that instead?
>
> Should I simply attempt to triangulate it myself without partitioning it
> (excluding edges based on angle)?
>
> Any help would be much appreciated.
>
> Cheers,
> Simon
>
>
>
> --
> View this message in context: 
> http://cgal-discuss.949826.n4.nabble.com/Triangulation-using-partitioning-performance-issues-tp4660951.html
> Sent from the cgal-discuss mailing list archive at Nabble.com.