| 多边形内点集的三角剖分算法 |
| |
| 引用本文： | 周培德. 多边形内点集的三角剖分算法[J]. 北京理工大学学报, 1995, 0(5) |
| |
| 作者姓名： | 周培德 |
| |
| 作者单位： | 北京理工大学计算机科学与工程系 |
| |
| 摘 要： | 提出了一种多边形内点集的三角剖分算法，该算法采用逐层求凸壳，对不在凸壳边界上的多边形顶点给予特殊处理，然后逐层分割环域成三角形序列，最后优化各三角形的边长，改变分割方式，使之能得到最短长度或接近最短长度的三角剖分．
|
| 关 键 词： | 多边形；三角剖分；凸包；计算几何 |
An Algorithm for the Triangulation of Point-Sets in an Arbitrary Polygon |
| |
| Zhou Peide. An Algorithm for the Triangulation of Point-Sets in an Arbitrary Polygon[J]. Journal of Beijing Institute of Technology(Natural Science Edition), 1995, 0(5) |
| |
| Authors: | Zhou Peide |
| |
| Abstract: | Presents an algorithm for the triangulation of point-sets in an arbitrary polygon. The algorithm adopts the procedure by first looking for the convex hulls layer by layer especially the vertices in the polygon not lying at the edges of the convex hulls; then cutting the ring domains into the sequence of the trilateral, and finally optimizing the length of the edges of every trilateral, and changing the cutting procedure to achieve the triangulation of the shortest(or close to the shortest). |
| |
| Keywords: | polygon trianglation convex hull computation geometry |
| 本文献已被 CNKI 等数据库收录！ |
| 点击此处可从《北京理工大学学报》浏览原始摘要信息 |
|
点击此处可从《北京理工大学学报》下载全文 |
