平面上两点集的联合三角剖分
On joint triangulations of two sets of points in the plane
摘要：
本文建立了平面上两组$n$点的联合三角剖分的两个必要条件，并猜想它们是充分的。我们表明这些必要条件可以在$O(n^3)$时间内进行测试。针对$n$顶点的两个简单多边形的联合三角剖分问题，提出了一种利用动态规划构造联合三角剖分的$O(n^3)$时间算法。
英文摘要：
In this paper, we establish two necessary conditions for a joint triangulation of two sets of $n$ points in the plane and conjecture that they are sufficient. We show that these necessary conditions can be tested in $O(n^3)$ time. For the problem of a joint triangulation of two simple polygons of $n$ vertices, we propose an $O(n^3)$ time algorithm for constructing a joint triangulation using dynamic programming.
机构、总结、中文摘要均由AI分析而来，可能存在错误，请以论文正文为准。
