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
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
|
#include "base/SRC_FIRST.hpp"
#include "geometry/robust_orientation.hpp"
#include "base/macros.hpp"
extern "C"
{
#if defined(__clang__)
#pragma clang diagnostic push
#pragma clang diagnostic ignored "-Wconditional-uninitialized"
#include "3party/robust/predicates.c"
#pragma clang diagnostic pop
#else
#include "3party/robust/predicates.c"
#endif
}
namespace m2 { namespace robust
{
bool Init()
{
exactinit();
return true;
}
double OrientedS(PointD const & p1, PointD const & p2, PointD const & p)
{
static bool res = Init();
ASSERT_EQUAL ( res, true, () );
UNUSED_VALUE(res);
double a[] = { p1.x, p1.y };
double b[] = { p2.x, p2.y };
double c[] = { p.x, p.y };
return orient2d(a, b, c);
}
bool IsSegmentInCone(PointD const & v, PointD const & v1,
PointD const & vPrev, PointD const & vNext)
{
double const cpLR = OrientedS(vPrev, vNext, v);
if (cpLR == 0.0)
{
// Points vPrev, v, vNext placed on one line;
// use property that polygon has CCW orientation.
return OrientedS(vPrev, vNext, v1) > 0.0;
}
if (cpLR < 0.0)
{
// vertex is concave
return OrientedS(v, vPrev, v1) < 0.0 && OrientedS(v, vNext, v1) > 0.0;
}
else
{
// vertex is convex
return OrientedS(v, vPrev, v1) < 0.0 || OrientedS(v, vNext, v1) > 0.0;
}
}
bool SegmentsIntersect(PointD const & a, PointD const & b,
PointD const & c, PointD const & d)
{
return
max(a.x, b.x) >= min(c.x, d.x) &&
min(a.x, b.x) <= max(c.x, d.x) &&
max(a.y, b.y) >= min(c.y, d.y) &&
min(a.y, b.y) <= max(c.y, d.y) &&
OrientedS(a, b, c) * OrientedS(a, b, d) <= 0.0 &&
OrientedS(c, d, a) * OrientedS(c, d, b) <= 0.0;
}
}
}
|
