songsenand
/
cgal
mirror of https://github.com/CGAL/cgal
1
0
Fork 0
Code Issues Packages Projects Releases Wiki Activity

equality test for polylines

This commit is contained in:
Naama Mayer 2008-08-21 15:02:44 +00:00
parent bf802f40d4
commit 63c18b5d54
2 changed files with 119 additions and 0 deletions
Show Stats Download Patch File Download Diff File Expand all files Collapse all files

1
.gitattributes vendored
View File

@ -1008,6 +1008,7 @@ Arrangement_on_surface_2/test/Arrangement_on_surface_2/data/test_adaptor/spheric
Arrangement_on_surface_2/test/Arrangement_on_surface_2/data/test_adaptor/spherical_arcs/points -text
Arrangement_on_surface_2/test/Arrangement_on_surface_2/data/test_adaptor/spherical_arcs/xcurves -text
Arrangement_on_surface_2/test/Arrangement_on_surface_2/data/test_observer/test01.txt -text
Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_do_equal.cpp -text
Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_do_intersect.cpp -text
Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cmd -text
Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_observer.cpp -text

118
Arrangement_on_surface_2/test/Arrangement_on_surface_2/test_do_equal.cpp Normal file
View File

@ -0,0 +1,118 @@
// Testing the do_equal function
#include <CGAL/Quotient.h>
#include <CGAL/Simple_cartesian.h>
#include <CGAL/Arr_segment_traits_2.h>
#include <CGAL/Arrangement_2.h>
#include <CGAL/Arr_geometry_traits/Polyline_2.h>
#include <CGAL/Arr_polyline_traits_2.h>
typedef CGAL::Quotient<int> Number_type;
typedef CGAL::Simple_cartesian<Number_type> Kernel;
typedef CGAL::Arr_segment_traits_2<Kernel> Segment_traits_2;
typedef CGAL::Arr_polyline_traits_2<Segment_traits_2> Traits_2;
typedef Traits_2::Point_2 Point_2;
typedef Traits_2::X_monotone_curve_2 X_monotone_curve_2;
int main ()
{
bool are_equal;
Traits_2 traits;
Traits_2::Equal_2 equal = traits.equal_2_object();
Point_2 points[5];
X_monotone_curve_2 curve_1, curve_2;
// Not equal case
points[0] = Point_2(0,0);
points[1] = Point_2(1,0);
points[2] = Point_2(2,0);
curve_1 = X_monotone_curve_2(&points[0], &points[3]);
points[0] = Point_2(0,0);
points[1] = Point_2(1,0);
points[2] = Point_2(3,0);
curve_2 = X_monotone_curve_2(&points[0], &points[3]);
are_equal = equal(curve_1, curve_2);
std::cout << "Answer1: " << are_equal<<std::endl;
// Regular equal case
points[0] = Point_2(0,0);
points[1] = Point_2(1,0);
points[2] = Point_2(2,0);
curve_1 = X_monotone_curve_2(&points[0], &points[3]);
points[0] = Point_2(0,0);
points[1] = Point_2(1,0);
points[2] = Point_2(2,0);
curve_2 = X_monotone_curve_2(&points[0], &points[3]);
are_equal = equal(curve_1, curve_2);
std::cout << "Answer2: " << are_equal<<std::endl;
// horizontal collinear case
points[0] = Point_2(0,0);
points[1] = Point_2(1,0);
points[2] = Point_2(3,0);
curve_1 = X_monotone_curve_2(&points[0], &points[3]);
points[0] = Point_2(0,0);
points[1] = Point_2(1,0);
points[2] = Point_2(2,0);
points[3] = Point_2(3,0);
curve_2 = X_monotone_curve_2(&points[0], &points[4]);
are_equal = equal(curve_1, curve_2);
std::cout << "Answer3: " << are_equal<<std::endl;
// collinear case
points[0] = Point_2(0,0);
points[1] = Point_2(2,2);
points[2] = Point_2(4,4);
curve_1 = X_monotone_curve_2(&points[0], &points[3]);
points[0] = Point_2(0,0);
points[1] = Point_2(2,2);
points[2] = Point_2(3,3);
points[3] = Point_2(4,4);
curve_2 = X_monotone_curve_2(&points[0], &points[4]);
are_equal = equal(curve_1, curve_2);
std::cout << "Answer4: " << are_equal<<std::endl;
// Vertical collinear case
points[0] = Point_2(1,0);
points[1] = Point_2(1,2);
points[2] = Point_2(1,4);
curve_1 = X_monotone_curve_2(&points[0], &points[3]);
points[0] = Point_2(1,0);
points[1] = Point_2(1,2);
points[2] = Point_2(1,3);
points[3] = Point_2(1,4);
curve_2 = X_monotone_curve_2(&points[0], &points[4]);
are_equal = equal(curve_1, curve_2);
std::cout << "Answer5: " << are_equal<<std::endl;
// Complicated not equal case
points[0] = Point_2(0,0);
points[1] = Point_2(1,1);
points[2] = Point_2(2,2);
points[3] = Point_2(4,2);
curve_1 = X_monotone_curve_2(&points[0], &points[4]);
points[0] = Point_2(0,0);
points[1] = Point_2(2,2);
points[2] = Point_2(3,3);
points[3] = Point_2(4,2);
curve_2 = X_monotone_curve_2(&points[0], &points[4]);
are_equal = equal(curve_1, curve_2);
std::cout << "Answer6: " << are_equal<<std::endl;
// Complicated equal case
points[0] = Point_2(0,0);
points[1] = Point_2(1,1);
points[2] = Point_2(2,2);
points[3] = Point_2(4,2);
curve_1 = X_monotone_curve_2(&points[0], &points[4]);
points[0] = Point_2(0,0);
points[1] = Point_2(2,2);
points[2] = Point_2(3,2);
points[3] = Point_2(4,2);
curve_2 = X_monotone_curve_2(&points[0], &points[4]);
are_equal = equal(curve_1, curve_2);
std::cout << "Answer7: " << are_equal<<std::endl;
return 0;
}