A Triangulation Algorithm for General Plane Polygon
Author:
Affiliation:
Fund Project:
摘要
|
图/表
|
访问统计
|
参考文献
|
相似文献
|
引证文献
|
资源附件
|
文章评论
摘要:
针对基于凹凸顶点判定的三角剖分算法适用范围有限的缺点, 提出了将凹凸顶点判定与连接多边形内外边界相结合的适用任意平面多边形的三角剖分算法GTP(General Triangulation of Polygons)。GTP计算速度快、适用范围广的良好特点已在应用中得到证实。
Abstract:
Considering the triangulation algorithm based only on the determination of convex-concave vertices is restricted to simple polygons, this paper presents a triangulation algorithm for the general plane polygon GTP(General Triangulation of Polygons) based on determination of convex-concave vertices and connecting the outer border of a polygon with its inner borders. GTP is rapid and can be applied to any plane polygon. GTP has been implemented and acquired good effect in application.
参考文献
相似文献
引证文献
引用本文
徐春蕾,李思昆.一种适用任意平面多边形的三角剖分算法[J].国防科技大学学报,2000,22(2):82-85. XU Chunlei, LI Sikun. A Triangulation Algorithm for General Plane Polygon[J]. Journal of National University of Defense Technology,2000,22(2):82-85.