关于平面中两组点的联合三角剖分
离散数学
2011-02-08 v1 计算几何
摘要
本文建立了平面中两组n个点的联合三角剖分的两个必要条件,并推测它们是充分的。我们证明这些必要条件可以在O(n^3)时间内检验。对于两个n顶点简单多边形的联合三角剖分问题,我们提出了一种使用动态规划的O(n^3)时间算法来构造联合三角剖分。
引用
@article{arxiv.1102.1235,
title = {On joint triangulations of two sets of points in the plane},
author = {Ajit Arvind Diwan and Subir Kumar Ghosh and Partha Pratim Goswami and Andrzej Lingas},
journal= {arXiv preprint arXiv:1102.1235},
year = {2011}
}
备注
The extended abstrat of this paper appeared in the Proceedings of India-Taiwan Conference on Discrete Mathematics, Taipei, pp. 34-43, 2009