mirror of https://github.com/CGAL/cgal
Removed the test of domain vertices since the random seed is configuration dependent
This commit is contained in:
parent
33ed6b6482
commit
388cf8bb54
|
|
@ -6,7 +6,6 @@
|
||||||
#include <CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h>
|
#include <CGAL/Hyperbolic_Delaunay_triangulation_traits_2.h>
|
||||||
|
|
||||||
#include <iostream>
|
#include <iostream>
|
||||||
#include <vector>
|
|
||||||
|
|
||||||
typedef CGAL::Cartesian<CGAL::Exact_rational> Kernel;
|
typedef CGAL::Cartesian<CGAL::Exact_rational> Kernel;
|
||||||
typedef CGAL::Hyperbolic_Delaunay_triangulation_traits_2<Kernel> ParentTraits;
|
typedef CGAL::Hyperbolic_Delaunay_triangulation_traits_2<Kernel> ParentTraits;
|
||||||
|
|
@ -23,27 +22,8 @@ int main()
|
||||||
Factory factory;
|
Factory factory;
|
||||||
Domain domain = factory.make_hyperbolic_fundamental_domain_g2(3459);
|
Domain domain = factory.make_hyperbolic_fundamental_domain_g2(3459);
|
||||||
|
|
||||||
std::vector<Point> vertices;
|
|
||||||
Point z0 = Point(FT("2057/2500"),FT("0"));
|
|
||||||
Point z1 = Point(FT("6183/10000"),FT("2369/5000"));
|
|
||||||
Point z2 = Point(FT("93/625"),FT("9299/10000"));
|
|
||||||
Point z3 = Point(FT("-129263137397146717229370666475391966694612741374/530219238243800202784978257516468117328515435625"),FT("443541103604461956104066082668282544568945930056/530219238243800202784978257516468117328515435625"));
|
|
||||||
Point z4 = Point(FT("-2057/2500"),FT("0"));
|
|
||||||
Point z5 = Point(FT("-6183/10000"),FT("-2369/5000"));
|
|
||||||
Point z6 = Point(FT("-93/625"),FT("-9299/10000"));
|
|
||||||
Point z7 = Point(FT("129263137397146717229370666475391966694612741374/530219238243800202784978257516468117328515435625"),FT("-443541103604461956104066082668282544568945930056/530219238243800202784978257516468117328515435625"));
|
|
||||||
vertices.push_back(z0);
|
|
||||||
vertices.push_back(z1);
|
|
||||||
vertices.push_back(z2);
|
|
||||||
vertices.push_back(z3);
|
|
||||||
vertices.push_back(z4);
|
|
||||||
vertices.push_back(z5);
|
|
||||||
vertices.push_back(z6);
|
|
||||||
vertices.push_back(z7);
|
|
||||||
|
|
||||||
assert(domain.size()==8);
|
assert(domain.size()==8);
|
||||||
for (std::size_t k=0; k<8; ++k) {
|
for (std::size_t k=0; k<8; ++k) {
|
||||||
assert(domain.vertex(k)==vertices[k]);
|
|
||||||
assert(domain.paired_side(k)==(k+4)%8);
|
assert(domain.paired_side(k)==(k+4)%8);
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
||||||
Loading…
Reference in New Issue