节点文献
基于最小内角动态判定的简单多边形三角剖分
Priangulation of Simple Polygon Based on Dynamic Determination of Minimum Internal Angle
【摘要】 提出了一种基于最小内角动态判定的简单多边形三角剖分算法,首先计算简单多边形内角的大小,然后按内角最小优先法并实时更新将多边形三角剖分,算法思想简单,效率高。
【Abstract】 This paper presents a fast algorithm for delaunay triangulation of simple polygon based on dynamic determination of minimum internal angle. Its basic idea is to calculate internal angle, then based on minimal internal angle priority, realize triangulation of simple polygon. This algorithm’ s idea is simple and its efficiency is very good.
【基金】 测绘遥感信息工程国家重点实验室开放研究基金(010302);国家“973”资助项目(G2000077904)
- 【文献出处】 计算机应用研究 ,Application Research of Computers , 编辑部邮箱 ,2004年04期
- 【分类号】TP391.41
- 【被引频次】16
- 【下载频次】201