首页 | 本学科首页   官方微博 | 高级检索  
   检索      

一种适用任意平面多边形的三角剖分算法
引用本文:徐春蕾,李思昆.一种适用任意平面多边形的三角剖分算法[J].国防科技大学学报,2000,22(2):82-85.
作者姓名:徐春蕾  李思昆
作者单位:国防科学技术大学计算机学院,湖南,长沙,410073
基金项目:国家“8 63”计划项目! ( 863 -5 11-4 2 -0 1)
摘    要:针对基于凹凸顶点判定的三角剖分算法适用范围有限的缺点 ,提出了将凹凸顶点判定与连接多边形内外边界相结合的适用任意平面多边形的三角剖分算法 GTP( General Triangulation of Polygons)。GTP计算速度快、适用范围广的良好特点已在应用中得到证实

关 键 词:三角剖分  多边形  凹凸顶点
收稿时间:1999/10/11 0:00:00

A Triangulation Algorithm for General Plane Polygon
XU Chunlei and LI Sikun.A Triangulation Algorithm for General Plane Polygon[J].Journal of National University of Defense Technology,2000,22(2):82-85.
Authors:XU Chunlei and LI Sikun
Institution:College of Computer, National Univ. of Defense Technology, Changsha 410073, China;College of Computer, National Univ. of Defense Technology, Changsha 410073, China
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.
Keywords:triangulation  polygon  convex  concave vertices
本文献已被 CNKI 万方数据 等数据库收录!
点击此处可从《国防科技大学学报》浏览原始摘要信息
点击此处可从《国防科技大学学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号