CGAL users discussion list

[KL <>]

Hi,

 

The issue: while the code below works, it returns too many triangles for a simple shape.

So, for a square, instead of two triangles made by one of the diagonal of the square, I get four tris, because the two diagonals are connecting.

 

I get my vertices using:

 

using K = CGAL::Exact_predicates_inexact_constructions_kernel;

using Triangulation = CGAL::Triangulation_3 <K>;

using Cell_handle = Triangulation::Cell_handle;

using Vertex_handle = Triangulation::Vertex_handle;

using Locate_type = Triangulation::Locate_type;

using Point_CGAL = Triangulation::Point;

...

Triangulation tri;

...

// load data

...

//loop

for ( auto &e : tri.finite_facets() ){

        auto &vert = *( e.first );

        auto starter_id = e.second;

 

        for ( u32 x = 1; x < 4; x += 1 ){

                auto &pt = *( vert.vertex( ( starter_id + x ) % 4 ) );                 // saw that line on the stackoverflow -> 3 finite vertices and 1 infinite vertice, hence the 4.

                // store my result

        }

}

 

I need the triangulation to be the minimum number of tris for any given shape. A square should have 2 tris.

 

I read the doc, but it is not among the easiest to wrap one's head around.

 

What should I modify, please?

 

Thanks

-- 

MKL