CGAL users discussion list

["Laurent Rineau (CGAL/GeometryFactory)" <>]

Le mardi 06 août 2013 01:43:03 Bear a écrit :
> I used the typical way to construct the constrained triangulation. Please
> see the code bellow, i also attached the full code  test_cgal_CT.cpp
> <http://cgal-discuss.949826.n4.nabble.com/file/n4657896/test_cgal_CT.cpp>  .

Your input polygons do intersect. You can see that modifying the code that 
way:

> typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
> typedef CGAL::Triangulation_vertex_base_2<K> VB;
> typedef CGAL::Constrained_triangulation_face_base_2<K> FB;
> typedef CGAL::Triangulation_face_base_2<K, FB> FBWI;
> typedef CGAL::Triangulation_data_structure_2<VB, FBWI> TDS;
> typedef CGAL::Exact_predicates_tag PT;

typedef CGAL::No_intersection_tag PT;

> typedef CGAL::Constrained_Delaunay_triangulation_2<K, TDS, PT> CDT;
> 
> typedef CGAL::Constrained_triangulation_plus_2<CDT> Triangulation;
> typedef CGAL::Polygon_2<K> Ring;
> typedef Triangulation::Point Point;
[...]

The intersections explain the new points in the output.

-- 
Laurent Rineau, PhD
R&D Engineer at GeometryFactory           http://www.geometryfactory.com/
Release Manager of the CGAL Project       http://www.cgal.org/