1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
|
#include <CGAL/Exact_predicates_inexact_constructions_kernel.h>
#include <CGAL/Regular_triangulation_2.h>
#include <CGAL/Regular_triangulation_euclidean_traits_2.h>
#include <CGAL/Triangulation_vertex_base_with_info_2.h>
#include <cassert>
#include <vector>
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
typedef CGAL::Regular_triangulation_euclidean_traits_2<K> Traits;
typedef CGAL::Exact_predicates_inexact_constructions_kernel K;
typedef CGAL::Regular_triangulation_vertex_base_2<Traits> Vbase;
typedef CGAL::Triangulation_vertex_base_with_info_2<unsigned, Traits,Vbase> Vb;
typedef CGAL::Regular_triangulation_face_base_2<Traits> Fb;
typedef CGAL::Triangulation_data_structure_2<Vb,Fb> Tds;
typedef CGAL::Regular_triangulation_2<Traits, Tds> Regular;
typedef K::Point_2 Point;
typedef Traits::Weighted_point_2 Wpoint;
int main()
{
std::vector< std::pair<Wpoint,unsigned> > points;
points.push_back( std::make_pair(Wpoint(Point(0,0),2),0) );
points.push_back( std::make_pair(Wpoint(Point(1,0),2),1) );
points.push_back( std::make_pair(Wpoint(Point(0,1),2),2) );
points.push_back( std::make_pair(Wpoint(Point(-4,54),2),3) );
points.push_back( std::make_pair(Wpoint(Point(2,2),2),4) );
points.push_back( std::make_pair(Wpoint(Point(-1,0),2),5) );
Regular rt;
rt.insert( points.begin(),points.end() );
CGAL_assertion( rt.number_of_vertices() == 6 );
// check that the info was correctly set.
Regular::Finite_vertices_iterator vit;
for (vit = rt.finite_vertices_begin(); vit != rt.finite_vertices_end(); ++vit)
if( points[ vit->info() ].first != vit->point() ){
std::cerr << "Error different info" << std::endl;
exit(EXIT_FAILURE);
}
std::cout << "OK" << std::endl;
return 0;
}
|
