多边形方向可视剖分技术  

Direction Visible Division in a Polygon

作　　者：张云辉[1] 高满屯[1] 吴建军[1] 王淑侠[1] 

机构地区：[1]西北工业大学机电学院,西安710072

出　　处：《模式识别与人工智能》2012年第5期817-825,共9页Pattern Recognition and Artificial Intelligence

基　　金：国家自然科学基金资助项目(No.61063030;51105310)

摘　　要：为实现简单多边形内的线燃烧轨迹计算,首先提出线视下方向可视的概念,指出8种可视的直线类型,并总结出7种桥结构模型.通过方向投影把多边形区域分成两个点可视区和两个方向可视区,利用主线和从线的遮挡关系来找桥头和桥尾以完成桥的构造,并实现多边形边界的方向可视剖分.其次,结合点可视剖分算法实现多边形的深度方向可视剖分,并进一步推导出多边形内任意点到任意线段的最短路径.最后,把该算法应用到多边形的线燃烧轨迹计算,取得良好的效果.To achieve line burning trajectory calculations within a simple polygon, the concept of direction visible is proposed under the condition of line view, eight types of visible lines are found firstly, and seven kinds of bridge structure models are summarized to achieve direction visible division for a simple polygon. Polygonal interior is divided into two point visible areas and two line visible areas under direction projection and the bridges are constructed to complete boundary direction division by using the block relationship between main line and secondary line. Then, combined with point visible division algorithm, the polygon is divided into deep direction visible sub-polygons. Using these sub-polygons, the shortest path from any point to any line is derived within original polygon. Finally, the proposed algorithm is applied to line burning trajectory calculation in a polygon and obtains a good performance.

关 键 词：方向可视 深度可视剖分 最短路径 桥结构 线燃烧 

分 类 号：TP391.41[自动化与计算机技术—计算机应用技术]