生成三维多边形平面域的双直线算法  

Generation Algorithm for 3D Polygon Region Using Two Lines

作　　者：李立新[1] 李小虎[1] 

机构地区：[1]浙江大学CAD&CG国家重点实验室,浙江杭州310027

出　　处：《工程图学学报》2008年第2期67-70,共4页Journal of Engineering Graphics

基　　金：浙江省自然科学基金资助项目(M603124)

摘　　要：提出了一种生成三维多边形平面域的新算法,该算法由主投影的扫描转换与主投影方向坐标的离散计算两部分构成。算法的两个部分相互独立,因而在第一部分可采用任意一种已有的多边形扫描转换算法来实现。主投影方向坐标的离散计算可通过两个整型数组(代表双直线)快速获得。算法可保证在理论上共面的两个多边形面域的公共部分在离散后完全重叠。A new algorithm for 3D polygon region generation is presented, which is consisted of two parts, namely scan-conversion of the principle projection of a 3D polygon region and discretization of the coordinates in principle projection direction. The two parts of the algorithm are independent each other, thereby any existed scan-conversing algorithm can be used in the first part. The discrete calculation of coordinates in principle projection direction uses two integer arrays which represent two lines. Any two polygon coplanar regions are ensured to be overlapped each other exactly in their common section after discretization by the algorithm.

关 键 词：计算机应用 三维多边形 多边形平面域 平面域生成算法 

分 类 号：TP301[自动化与计算机技术—计算机系统结构]