12 #include <klm/eklm/geometry/Polygon2D.h>
15 #include <framework/core/RandomNumbers.h>
24 for (i = 0; i < n; i++) {
35 for (i = 0; i < m_nPoints; i++)
36 delete m_LineSegments[i];
37 delete[] m_LineSegments;
42 int i, n, nIntersections;
47 angle = gRandom->Uniform(0., 2.0 * M_PI);
48 Line2D line(point.x(), point.y(), cos(angle), sin(angle));
49 for (i = 0; i < m_nPoints; i++) {
50 n = m_LineSegments[i]->Line2D::findIntersection(line, &intersection, t);
54 if (t[0] == 0 || t[0] == 1)
56 if (t[0] > 0 && t[0] < 1 && t[1] > 0)
60 if (nIntersections % 2 == 1)
69 for (i = 0; i < m_nPoints; i++) {
70 if (m_LineSegments[i]->findIntersection(lineSegment, &intersection) > 0)
82 for (i = 0; i < m_nPoints; i++) {
83 if (m_LineSegments[i]->findIntersection(arc, intersections) > 0)
94 for (i = 0; i < m_nPoints; i++) {
99 polygon.
pointInside(m_LineSegments[0]->getInitialPoint()))