凸位置点的快速瓶颈无交叉匹配
Faster Bottleneck Non-crossing Matchings of Points in Convex Position
摘要:
给定平面上的偶数个点,我们感兴趣的是用直线段匹配所有的点,使得线段不交叉。瓶颈匹配是最小化最长段的长度的匹配。对于凸位置上的点,我们提出了一个二次时间的算法来寻找一个瓶颈的非交叉匹配,改进了以前已知的最好的三次时间复杂度的算法。
英文摘要:
Given an even number of points in a plane, we are interested in matching all the points by straight line segments so that the segments do not cross. Bottleneck matching is a matching that minimizes the length of the longest segment. For points in convex position, we present a quadratic-time algorithm for finding a bottleneck non-crossing matching, improving upon the best previously known algorithm of cubic time complexity.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。