mirror of https://github.com/CGAL/cgal
36 lines
1.2 KiB
C++
36 lines
1.2 KiB
C++
// file : examples/Triangulation_2/constrained.C
|
|
|
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
|
|
#include <CGAL/Constrained_Delaunay_triangulation_2.h>
|
|
|
|
struct K : CGAL::Exact_predicates_inexact_constructions_kernel {};
|
|
|
|
typedef CGAL::Triangulation_vertex_base_2<K> Vb;
|
|
typedef CGAL::Constrained_triangulation_face_base_2<K> Fb;
|
|
typedef CGAL::Triangulation_data_structure_2<Vb,Fb> TDS;
|
|
typedef CGAL::Exact_predicates_tag Itag;
|
|
typedef CGAL::Constrained_Delaunay_triangulation_2<K, TDS, Itag> CDT;
|
|
typedef CDT::Point Point;
|
|
|
|
int
|
|
main( )
|
|
{
|
|
CDT cdt;
|
|
std::cout << "Inserting a grid of 5x5 constraints " << std::endl;
|
|
for (int i = 1; i < 6; ++i)
|
|
cdt.insert_constraint( Point(0,i), Point(6,i));
|
|
for (int j = 1; j < 6; ++j)
|
|
cdt.insert_constraint( Point(j,0), Point(j,6));
|
|
|
|
assert(cdt.is_valid());
|
|
int count = 0;
|
|
for (CDT::Finite_edges_iterator eit = cdt.finite_edges_begin();
|
|
eit != cdt.finite_edges_end();
|
|
++eit)
|
|
if (cdt.is_constrained(*eit)) ++count;
|
|
std::cout << "The number of resulting constrained edges is ";
|
|
std::cout << count << std::endl;
|
|
return 0;
|
|
}
|
|
|