-
Notifications
You must be signed in to change notification settings - Fork 1
/
Copy pathExt_Math.h
155 lines (150 loc) · 3.99 KB
/
Ext_Math.h
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
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
/********************************************************************
Copyright (c) 2002-2003 汉王科技有限公司. 版权所有.
文件名称: Ext_Math.h
文件内容: 简单的一些常用数学操作
版本历史: 1.0
作者: xuejuntao [email protected] 2008/02/26
*********************************************************************/
#ifndef _HWXUE_Ext_Math_INC
#define _HWXUE_Ext_Math_INC
#include "Ext_Type.h"
//求点到线段的最短距离 及最短距离点
//LONG Mth_GetMinDist(const HWPoint &tPtA, const HWPoint &tPtB, const HWPoint &tPtC, HWPoint &tNearestPt);
LONG DivRound(long x, long div);
LONG MulDivRound(long x, long mul, long div);
#ifdef __cplusplus
extern "C"{
#endif
DLLXEXPORT long XSqrt(const long& nRoot);//整数开方函数，
DLLXEXPORT void XQsort( void *base, long num, long width, long *pComp);//快速排序函数
DLLXEXPORT void ZB_SwapIdx ( char *a, char *b, unsigned long nIdxWidth);
#ifdef __cplusplus
}
#endif
template<typename XPoint>
static LONG IsLeft(const XPoint& tLineBgn, const XPoint& tLineEnd, const XPoint& tDst )
{
return ((tLineEnd.x - tLineBgn.x) * (tDst.y - tLineBgn.y)
- (tDst.x - tLineBgn.x) * (tLineEnd.y - tLineBgn.y));
}
template<typename XPoint>
LONG XGetMinDist(const XPoint &tPtA, const XPoint &tPtB, const XPoint &tPtC,
XPoint &tNearestPt)
{
XPoint tPointAToB = XPoint(tPtB.x - tPtA.x, tPtB.y - tPtA.y);
XPoint tPointAToC = XPoint(tPtC.x - tPtA.x, tPtC.y - tPtA.y);
double dM = tPointAToB.x * tPointAToC.x + tPointAToB.y * tPointAToC.y;
double dN = tPointAToB.x * tPointAToB.x + tPointAToB.y * tPointAToB.y;
double dDelta = dM / dN;
if (dDelta < 0.0)
{
tNearestPt = tPtA;
}
else if (dDelta > 1.0)
{
tNearestPt = tPtB;
}
else
{
tNearestPt = tPointAToB;
tNearestPt.x *= dDelta;
tNearestPt.y *= dDelta;
tNearestPt.x += tPtA.x;
tNearestPt.y += tPtA.y;
}
return std::sqrt(1.0 * (
(tNearestPt.x - tPtC.x) * (tNearestPt.x - tPtC.x) +
(tNearestPt.y - tPtC.y) * (tNearestPt.y - tPtC.y))
);
}
//************************************
// Method: Ext_Mth_PtWithPolygon
// FullName: Ext_Mth_PtWithPolygon
// Access: public
// Returns: BOOL : 0 在多边形边上 -1 在内部 1 在外部
// Qualifier:判断点与多边形的关系 第一个参数 为多边形依此定点 2 为定点个数 3 目标点坐标
// Parameter: TPoint * ptPolygon
// Parameter: long nPtNum
// Parameter: TPoint * ptTarget
//************************************
template<typename XPoint, typename LPXPoint>
LONG Mth_PtWithPolygon(LPXPoint pBgn, LPXPoint pEnd, const XPoint& tTarget, XPoint&vValue)
{
BOOL nRet = 1;
LONG nTag = 0, nPos = -1;
LONG nDistance = 0;
XPoint tPointTmp;
LPXPoint pIndexA = pBgn, pIndexB;
nDistance = std::sqrt(1.0 * (pBgn->x - tTarget.x) * (pBgn->x - tTarget.x) +
(pBgn->y - tTarget.y) * (pBgn->y - tTarget.y));
vValue = *pBgn;
tPointTmp = vValue;
if (pBgn != pEnd)
{
//pIndexA ++;
LONG nTmpDistance = nDistance;
while (pIndexA != pEnd)
{
pIndexB = pIndexA + 1;
if (pIndexB == pEnd)
{
pIndexB = pBgn;
}
//计算点到线段的距离
nTmpDistance = XGetMinDist(*pIndexA, *pIndexB, tTarget, tPointTmp);
if (nTmpDistance < nDistance)
{
nDistance = nTmpDistance;
vValue = tPointTmp;
}
//计算点与线段的方向
if (0 != nRet)
{
if (pIndexA->y <= tTarget.y)
{
if (pIndexB->y > tTarget.y)
{
nPos = IsLeft(*pIndexA, *pIndexB, tTarget);
if (nPos > 0)
{
nTag ++;
}
else if(0 == nPos)
{
nRet = 0;
}
}
}
else
{
if (pIndexB->y <= tTarget.y)
{
nPos = IsLeft(*pIndexA, *pIndexB, tTarget);
if (nPos < 0)
{
nTag -- ;
}
else if (0 == nPos)
{
nRet = 0;
}
}
}
}
pIndexA ++;
}
}
if (0 != nRet)
{
if (0 != nTag)
{
nRet = -1;
}
else
{
nRet = 1;
}
}
return nRet * nDistance;
}
#endif // !defined(_HWXUE_Ext_Math_INC)