三角网的生成算法

楼主^#

更多发布于：2005-08-19 12:03

<PRE>#ifndef TIN_H
#define TIN_H
#include<iostream>
#include<cmath>
#include<vector>
#include<fstream>
#include"WGraphics.h"
using namespace std;

typedef struct mo
{
int m;
int n;
int mark;
}mo;

typedef struct o
{
double x;
double y;
}Point;

typedef struct sample//文件读入的采样点结构
{
Point point;
int Mark;
int Number;//采样点编号
}Sample;

class TIN
{

public:
void GetData();

void Display(int scale);

//---------------------------------------------------------------------
~TIN()
{ delete [] dot; }
inline double Distance(Point p1,Point p2)//计算两点之间的距离
{ return(sqrt((p1.x-p2.x)*(p1.x-p2.x)+(p1.y-p2.y)*(p1.y-p2.y))); }
//----------------------------------------------------------------------------
inline double ComputeAngle(Point p1,Point p2,Point p3)//计算角C的弧度
{
double a=Distance(p2,p3);
double b=Distance(p3,p1);
double c=Distance(p1,p2);
return acos((a*a+b*b-c*c)/(2*a*b)); }
//--------------------------------------------------------------------------------
inline int F(Point p1,Point p2,Point p3)//计算点在直线的区间
{
double A=(p2.y-p1.y)/(p2.x-p1.x);
double B=(p1.y*p2.x-p2.y*p1.x)/(p2.x-p1.x);
double f=p3.y-A*p3.x-B;
if(f>0)
return 1;
else if(f<0)
return -1;
else
return 0;
}
//--------------------------------------------------------------------------------
int Search(int p1,int p2,int p3); //检查三角形是否重复或交叉

//--------------------------------------------------------------------------------
int Extend(int p1,int p2,int p3);//以p1，p2位基边扩展三角形
//--------------------------------------------------------------------------------
void Terminal(int key);
//----------------------------------------------------------------------
protected:
vector<int> t1;
vector<int> t2;
vector<int> t3;
int K;
int L;
Sample * dot;
int N;
};

#endif

int TIN::Search(int p1,int p2,int p3) //检查三角形是否重复或交叉
{
mo Field[7];
Field[1].m=p1; Field[1].n=p2; Field[1].mark=0;
Field[2].m=p2; Field[2].n=p1; Field[2].mark=0;

Field[3].m=p1; Field[3].n=p3; Field[3].mark=0;
Field[4].m=p3; Field[4].n=p1; Field[4].mark=0;

Field[5].m=p2; Field[5].n=p3; Field[5].mark=0;
Field[6].m=p3; Field[6].n=p2; Field[6].mark=0;

for(int i=1;i<=L;i++)
{
for(int j=1;j<7;j++)
{
if((Field[j].m==t1 || Field[j].m==t2 || Field[j].m==t3) ;; (Field[j].n==t1 || Field[j].n==t2 || Field[j].n==t3) )
Field[j].mark++;
}

}
for( i=1;i<7;i++)
if(Field.mark==2)
return true;
return false;//三角形没有重复

}

//------------------------------------------------------
int TIN::Extend(int p1,int p2,int p3)//以p1,p2为基线生成三角形
{
int m=F(dot[p1].point,dot[p2].point,dot[p3].point);
double Angle1=0;
double Angle2=0;
int sign=0;
for(int i=1;i<=N;i++)
{
dot.Mark=F(dot[p1].point,dot[p2].point,dot.point);
if(dot.Mark+m==0 )
{
Angle2=ComputeAngle(dot[p1].point,dot[p2].point,dot.point);
if(Angle2>Angle1)
{
Angle1=Angle2;
sign=i;
}
}
}
if(sign!=0 ;; !Search(p1,p2,sign))
{
L++;
t1.push_back(p1); t2.push_back(p2); t3.push_back(sign);
return sign;//新生成三角形找到了
}
else return 0;
}
//--------------------------------------------------------------------
void TIN::Terminal(int key)
{ K=0; L=1;
t1.push_back(0);
t2.push_back(0);
t3.push_back(0);
int a,b,c;

double dis1=999999999;
double dis2;
double angle1=0;
double angle2=0;
int m;
for(int i=1;i<=N;i++)
{
if(key!=i)
{dis2=Distance(dot[key].point,dot.point);
if(dis2<dis1)
{
m=i;
dis1=dis2;
}
}
}
t1.push_back(key); t2.push_back(m);
for(i=1;i<=N;i++)
{
angle2=ComputeAngle(dot[t1[1]].point,dot[t2[1]].point,dot.point);
if(angle2>angle1)
{
angle1=angle2;
m=i;
}
}
t3.push_back(m);
//********************************第一个种子三角形生成
while(K!=L)
{

K++;
a=Extend(t1[K],t2[K],t3[K]);
b=Extend(t2[K],t3[K],t1[K]);
c=Extend(t3[K],t1[K],t2[K]);
}
}
//-----------------------------------------------------------------------
void TIN::GetData()
{
ifstream in_stream;
in_stream.open("data2.txt");
if(in_stream==NULL)
exit(0);

in_stream>>N;
dot=new Sample[N+1];

for(int i=1;i<=N;i++)
in_stream>>dot.Number>>dot.point.x>>dot.point.y;

in_stream.close();
}
//--------------------------------------------------------------------------
void TIN::Display(int scale)
{
//cout<<t1.size()<<endl;
SetColor(RGB(0,255,0));
for(int i=1;i<t1.size();i++)
{
//cout<<t1<<" "<<t2<<" "<<t3<<endl;
DrawLine((long)(dot[t1].point.x*scale+20),(long)(600-dot[t1].point.y*scale),(long)(dot[t2].point.x*scale+20),(long)(600-dot[t2].point.y*scale));
DrawLine((long)(dot[t2].point.x*scale+20),(long)(600-dot[t2].point.y*scale),(long)(dot[t3].point.x*scale+20),(long)(600-dot[t3].point.y*scale));
DrawLine((long)(dot[t3].point.x*scale+20),(long)(600-dot[t3].point.y*scale),(long)(dot[t1].point.x*scale+20),(long)(600-dot[t1].point.y*scale));
}
}</PRE>

喜欢0 评分0

举报回复

gis

管理员

注册日期2003-07-16
发帖数15945
QQ554730525
铜币25337枚
威望15352点
贡献值0点
银元0个

加关注写私信

1楼^#

发布于：2005-08-19 12:03

数据：
200 1 36.859 33.744 2 2.723 94.694 3 20.689 51.958 4 41.067 98.866 5 80.606 88.158 6 97.301 43.727 7 57.425 5.487 8 46.739 20.691 9 87.433 56.556 10 15.629 58.531 11 89.023 18.050 12 71.585 85.100 13 63.809 83.486 14 31.507 59.100 15 1.477 28.037 16 72.248 55.988 17 9.174 24.542 18 67.880 24.042 19 40.638 30.574 20 25.508 98.535 21 48.797 34.709 22 38.793 78.996 23 47.156 64.855 24 61.102 71.650 25 77.669 59.760 26 80.200 87.957 27 100.328 3.589 28 7.663 14.271 29 90.359 21.649 30 89.856 35.670 31 48.987 39.285 32 20.560 28.807 33 24.909 3.826 34 70.220 16.015 35 51.336 69.704 36 27.788 75.450 37 94.686 42.673 38 57.284 23.382 39 12.875 89.178 40 60.830 52.608 41 31.272 11.840 42 63.477 36.018 43 25.260 75.041 44 98.533 90.232 45 19.367 10.666 46 14.559 5.438 47 100.155 71.949 48 95.993 34.243 49 34.592 53.480 50 86.434 43.775 51 10.135 82.279 52 33.439 33.834 53 79.426 55.050 54 42.090 10.172 55 23.557 54.520 56 43.061 29.914 57 23.051 17.921 58 70.431 99.134 59 45.410 69.604 60 52.959 43.468 61 39.257 20.780 62 21.171 29.941 63 50.218 25.351 64 21.946 60.886 65 39.274 4.882 66 46.722 28.976 67 23.905 29.757 68 77.455 25.403 69 17.693 66.351 70 36.036 23.152 71 98.680 85.436 72 55.442 17.430 73 79.296 34.620 74 53.492 24.219 75 91.891 73.976 76 32.203 49.933 77 85.951 68.772 78 75.789 15.216 79 41.902 50.305 80 69.295 50.845 81 90.513 39.917 82 29.805 42.798 83 49.009 26.065 84 44.369 53.391 85 71.669 19.588 86 30.467 96.601 87 7.239 55.017 88 94.112 80.485 89 74.794 69.083 90 17.639 6.685 91 47.312 26.346 92 46.039 37.124 93 49.865 24.882 94 93.987 22.801 95 71.444 47.136 96 61.430 92.721 97 87.347 86.972 98 62.872 6.875 99 92.277 31.664 100 70.192 70.514 101 54.009 7.262 102 64.188 15.325 103 68.701 89.810 104 7.698 36.949 105 35.845 75.937 106 15.294 95.434 107 43.777 14.413 108 53.718 84.993 109 67.933 6.863 110 42.830 61.732 111 82.579 64.665 112 70.247 28.603 113 80.317 29.913 114 25.615 92.399 115 12.091 60.492 116 38.417 80.006 117 29.887 75.364 118 31.545 13.603 119 52.064 64.896 120 92.348 49.151 121 37.237 61.317 122 50.426 84.888 123 61.907 73.355 124 66.003 21.027 125 28.547 82.984 126 37.895 89.548 127 69.535 2.208 128 19.134 47.090 129 71.470 98.126 130 47.252 23.013 131 13.303 72.986 132 84.088 35.583 133 9.977 15.425 134 71.343 74.222 135 77.802 3.839 136 97.690 34.952 137 5.281 81.849 138 77.486 22.961 139 34.782 92.882 140 42.168 21.210 141 69.653 72.988 142 45.265 17.286 143 76.048 10.579 144 79.980 90.295 145 10.347 72.497 146 5.465 67.898 147 53.264 83.097 148 92.697 39.479 149 58.453 71.447 150 75.926 33.459 151 14.893 81.714 152 19.881 58.712 153 14.765 43.660 154 99.414 6.055 155 44.044 9.182 156 92.974 15.997 157 79.664 44.135 158 82.516 3.484 159 97.344 89.099 160 75.171 47.805 161 97.005 85.413 162 30.473 50.688 163 38.836 52.262 164 100.257 44.408 165 88.978 36.920 166 87.112 73.121 167 81.824 23.084 168 6.539 35.250 169 91.977 3.377 170 70.681 81.092 171 21.766 9.953 172 77.685 81.373 173 96.495 15.186 174 14.724 56.168 175 77.160 88.574 176 77.595 60.731 177 83.974 17.729 178 98.978 42.565 179 27.370 93.421 180 90.300 52.597 181 63.717 55.855 182 94.233 29.477 183 48.579 4.013 184 54.821 30.956 185 12.718 65.154 186 94.216 44.474 187 48.588 31.374 188 6.054 46.814 189 7.558 55.384 190 57.453 35.896 191 10.722 7.347 192 8.641 18.663 193 69.313 98.852 194 41.168 64.191 195 25.738 68.032 196 97.820 18.780 197 96.344 21.765 198 40.106 85.323 199 33.638 48.083 200 12.357 61.651 ----------------------------------------- //Data end

举报回复喜欢评分

射天狼路人甲注册日期2003-11-28 发帖数45 QQ 铜币187枚威望0点贡献值0点银元0个加关注写私信	2楼^# 发布于：2005-11-19 18:26 没有参考文献还不是像看天书一样。
	举报回复(0) 喜欢(0) 评分

小劫路人甲注册日期2004-07-10 发帖数6 QQ 铜币134枚威望0点贡献值0点银元0个加关注写私信	3楼^# 发布于：2006-01-01 10:39 谢了大大~~~~
	举报回复(0) 喜欢(0) 评分

gzstyxb

路人甲

注册日期2004-09-22
发帖数358
QQ
铜币1045枚
威望0点
贡献值0点
银元0个

加关注写私信

4楼^#

发布于：2006-01-25 15:38

我试过了，无法编译，还缺个函数什么的

由爱故生忧, 由爱故生怖. 若离于爱者, 无忧亦无怖.

举报回复喜欢评分

烦少路人甲注册日期2005-11-08 发帖数26 QQ 铜币166枚威望0点贡献值0点银元0个加关注写私信	5楼^# 发布于：2006-05-21 00:47 <img src="images/post/smile/dvbbs/em01.gif" />谢谢了
	举报回复(0) 喜欢(0) 评分

robinshe 路人甲注册日期2006-06-13 发帖数4 QQ 铜币120枚威望0点贡献值0点银元0个加关注写私信	6楼^# 发布于：2006-06-13 16:33 请问.WGraphics.h 头文件怎么写哦.
	举报回复(0) 喜欢(0) 评分

jinwei0502 路人甲注册日期2006-05-26 发帖数23 QQ 铜币157枚威望0点贡献值0点银元0个加关注写私信	7楼^# 发布于：2006-06-28 22:13 看不懂！
	举报回复(0) 喜欢(0) 评分

cwcjcwcj 路人甲注册日期2006-01-17 发帖数7 QQ 铜币132枚威望0点贡献值0点银元0个加关注写私信	8楼^# 发布于：2006-07-11 21:12 麻烦老大把头文件WGraphics.h补一下哦，要不这个程序无法运行，自定义的头文件。。。
	举报回复(0) 喜欢(0) 评分

cwcjcwcj 路人甲注册日期2006-01-17 发帖数7 QQ 铜币132枚威望0点贡献值0点银元0个加关注写私信	9楼^# 发布于：2006-07-11 23:35 另外好像没有主函数。只是一个类的定义。
	举报回复(0) 喜欢(0) 评分

您需要登录后才可以回帖，登录或者注册

三角网的生成算法

最新喜欢：