mirror of https://github.com/CGAL/cgal
39 lines
947 B
C++
39 lines
947 B
C++
#include "numrep1.h"
|
|
#include <CGAL/Point_2.h>
|
|
#include <CGAL/Ray_2.h>
|
|
#include <CGAL/squared_distance_2.h>
|
|
|
|
|
|
#include "numrep2.h"
|
|
|
|
typedef CGAL::Point_2< TestR > point_t;
|
|
typedef CGAL::Ray_2< TestR > ray_t;
|
|
|
|
using std::cout;
|
|
|
|
int main()
|
|
{
|
|
randomint ri;
|
|
int x1, x2, y1, y2, w1, w2;
|
|
TestR::FT d, d2;
|
|
std::cin >> x1 >> y1;
|
|
if (!std::cin)
|
|
return 1;
|
|
w1 = ri.next();
|
|
point_t pt(to_nt(w1*x1), to_nt(w1*y1), to_nt(w1));
|
|
std::cin >> x1 >> y1 >> x2 >> y2;
|
|
if (!std::cin)
|
|
return 1;
|
|
w1 = ri.next();
|
|
w2 = ri.next();
|
|
point_t tp1(to_nt(w1*x1), to_nt(w1*y1), to_nt(w1));
|
|
point_t tp2(to_nt(w2*x2), to_nt(w2*y2), to_nt(w2));
|
|
ray_t ray(tp1, tp2);
|
|
d = CGAL::squared_distance(pt, ray);
|
|
cout << CGAL::to_double(d) << '\n';
|
|
d2 = CGAL::Squared_distance_to_ray<TestR>(ray)(pt);
|
|
if (d2 != d)
|
|
cout << "Methods give different results: "<<d<<" and "<<d2<<"\n";
|
|
return (d2 == d) ? 0 : 1;
|
|
}
|