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
|
/***************************************************************************
* Developer: Francisco Martínez del Río (2011) *
* fmartin@ujaen.es *
* Version: 1.4.1 *
* *
* This is a public domain program *
***************************************************************************/
// Utility functions
#ifndef UTILITIES_H
#define UTILITIES_H
#include "polygon.h"
int findIntersection (const Segment& seg0, const Segment& seg1, Point& ip0, Point& ip1);
/** Signed area of the triangle (p0, p1, p2) */
inline float signedArea (const Point& p0, const Point& p1, const Point& p2)
{
return (p0.x - p2.x)*(p1.y - p2.y) - (p1.x - p2.x) * (p0.y - p2.y);
}
/** Signed area of the triangle ( (0,0), p1, p2) */
inline float signedArea (const Point& p1, const Point& p2)
{
return -p2.x*(p1.y - p2.y) - -p2.y*(p1.x - p2.x);
}
/** Sign of triangle (p1, p2, o) */
inline int sign (const Point& p1, const Point& p2, const Point& o)
{
float det = (p1.x - o.x) * (p2.y - o.y) - (p2.x - o.x) * (p1.y - o.y);
return (det < 0 ? -1 : (det > 0 ? +1 : 0));
}
inline bool pointInTriangle (const Segment& s, Point& o, Point& p)
{
int x = sign (s.begin (), s.end (), p);
return ((x == sign (s.end (), o, p)) && (x == sign (o, s.begin (), p)));
}
#endif
|
