任意曲面上射线的寻迹方法  

Ray path tracing on discrete surface

作　　者：陈志贤[1] 苏东林[1] 刘焱[1] 方向[1] 

机构地区：[1]北京航空航天大学电子信息工程学院,北京100191

出　　处：《北京航空航天大学学报》2013年第5期665-669,共5页Journal of Beijing University of Aeronautics and Astronautics

基　　金：国家重点自然科学基金资助项目(60831001)

摘　　要：为计算任意曲面上天线间的隔离度,提出一种射线寻迹的新算法——最小夹角法.首先对任意曲面表面进行三角形网格剖分,并按照文中要求的格式生成模型表面网格数据;用文中提出的"最小夹角法"对上述网格数据进行处理,从而达到快速准确地找出任意曲面上、任意两点间的短程线.求解了位于圆柱体、椭球体及任意组合体上任意两点间的短程线长度,验证了"最小夹角法"的准确性.In order to analyze antenna isolation on discrete surface, a new algorithm for ray tracing that called ＂minimum included angle algorithm＂ was proposed. First, the discrete surface was divided into triangu- lar mesh to generate surface grid data that accord with the format required in the article. The data mentioned above was processed by using minimum included angle algorithm that was proposed in this paper. Then the length of geodesic path between any two points on discrete surface could be quickly and veraciously achieved. The length of geodesic path between any two points on cylinder, ellipse and discrete arrangement was compu- ted, to confirm the veracity of ＂minimum included angle algorithm＂ on discrete surface.

关 键 词：射线寻迹 短程线 爬行波 

分 类 号：TN011.4[电子电信—物理电子学]