| 周培德三角剖分不是最小权三角剖分 |
| |
| 引用本文： | 刘金义. 周培德三角剖分不是最小权三角剖分[J]. 计算机辅助设计与图形学学报, 2001, 13(12): 1150-1152 |
| |
| 作者姓名： | 刘金义 |
| |
| 作者单位： | 抚顺石油学院计算机科学与技术系,抚顺,113001 |
| |
| 摘 要： | 平面点集的（欧几里德）最小权三角剖分问题是计算几何和算法领域的一个长期悬而未决的公开问题,周培德于文献[1]中提出了一个新的平面点集三角剖分算,并称该算法能够获得最小权三角剖分,文中通过给出反例,证明了该三角剖分不是最小权三角剖分,因此,最小权三角剖分问题仍有待于进一步研究。
|
| 关 键 词： | 计算几何 平面点集 最小权三角剖分 |
| 修稿时间： | 2000-11-06 |
Zhou's Triangulation is not the Minimum Weight Triangulation |
| |
| LIU Jin-Yi. Zhou's Triangulation is not the Minimum Weight Triangulation[J]. Journal of Computer-Aided Design & Computer Graphics, 2001, 13(12): 1150-1152 |
| |
| Authors: | LIU Jin-Yi |
| |
| Abstract: | The (Euclidean) minimum weight triangulation (MWT) of a planar point set is a long-standing open problem in the fields of computational geometry and algorithm design. Reference[1] presents a new triangulation algorithm, and claims that the algorithm can derive the MWT of a planar point set. By presenting counter-examples, this note proves that the triangulation is not the MWT. So, the problem of the MWT is still open. |
| |
| Keywords: | computational geometry planar point set minimum weight triangulation |
| 本文献已被 CNKI 维普 万方数据 等数据库收录！ |
|
